記錄點滴。
學習不是為了找到答案，而是理解知識的含義，成為自己的隱形財富，學到的知識只有不斷地練習才能得到鞏固，程式設計要的是動手能力。
不斷充實自己才應該是我們的追求，要學會不滿足。
小菜一枚，如果有東軟的大哥看到我的程式碼存在問題，望指出，共同學習
Problem1000
#include <stdio.h>
int main(){
int a,b;
while(scanf("%d %d",&a, &b) != EOF)
printf("%d\n",a+b);
return 0;
}
Problem1001
#include <stdio.h>
int main(){
int a,b;
while(scanf("%d",&a) != EOF)
printf("%c",a);
return 0;
}
Problem1002
#include<stdio.h>
int main(){
int N,a,i,b;
scanf("%d",&N);
for(a=2;a<=N;a++)
{
b=1;
for(i=2;i<a;i++)
{
if(a%i==0)
b=0;
}
if(b!=0)
printf("%d\n",a);
}
}
Problem1003
#include <stdio.h>
int main()
{
int a,b;
while(scanf("%d %d",&a, &b) != EOF)
printf("%d\n",a+b);
return 0;
}
Problem1003
#include<stdio.h>
int main(){
int a,n;
while(scanf("%d%d",&a,&n)!=EOF)
printf("%d\n",a+n);
return 0;
}
Problem1004
#include<stdio.h>
int main(){
int i,n;
scanf("%d",&n);
for(i=1;i<=n;i++){
int a,b;
scanf("%d%d",&a,&b);
printf("%d\n",a+b);
}
return 0;
}
Problem1004
#include <stdio.h>
int main(){
int i,n,a,b,c;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d%d",&a,&b);
c=a+b;
printf("%d\n",c);
}
return 0;
}
Problem1005
#include <stdio.h>
int main()
{
int a,b,n,i;
while(scanf("%d%d",&a,&b)!=EOF){
if(a==0&&b==0){
break;
}
printf("%d\n",a+b);}
return 0;
}
Problem1006
#include <stdio.h>
int main()
{
int n;
while(scanf("%d",&n)!=EOF){
if(n==0){
break;
}
int i,a,sum=0;
for(i=1;i<=n;i++){
scanf("%d",&a);
sum+=a;
}
printf("%d\n",sum);
}
return 0;
}
Problem1007
#include <stdio.h>
int main()
{
int n,i;
scanf("%d",&n);
for(i=1;i<=n;++i){
int m,j,a,sum=0;
scanf("%d",&m);
for(j=1;j<=m;++j){
scanf("%d",&a);
sum+=a;}
printf("%d\n",sum);
}
return 0;
}
Problem1008
#include <stdio.h>
int main()
{
int n;
while(scanf("%d",&n)!=EOF){
int i,a,sum=0;
for(i=1;i<=n;i++){
scanf("%d",&a);
sum+=a;
}
printf("%d\n",sum);
}
return 0;
}
Problem1009
#include<stdio.h>
int main(){
int a,b;
while(scanf("%d%d",&a,&b)!=EOF)
printf("%d\n\n",a+b);
return 0;
}
Problem1010
#include <stdio.h>
int main()
{
int n,s,m,sum;
scanf("%d",&n);
while(n--){
scanf("%d",&s);
sum=0;
while(s--){
scanf("%d",&m);
sum+=m;
}
printf("%d\n",sum);
printf("\n") ;
}
return 0;
}
Problem1011
#include <stdio.h>
#include <string.h>
int main(){
char c1[100];
int i;
gets(c1);
char c2[strlen(c1)];
for(i=0;i<=strlen(c1);i++){
c2[i]=c1[strlen(c1)-i-1];
}
puts(c2);
}
Problem1012
#include<iostream>
#include<string>
using namespace std;
int main()
{
int n;
char a[1010];
cin>>n;
getchar();
while(n--)
{
gets(a);
puts(a);
cout<<endl; //前n行的輸出
}
while(gets(a))
//就是這裡!不斷輸入字串,並輸出
{ int i;
for(i=0;i<strlen(a);i++)
//遇空格換行
{ if(a[i]==' ')
cout<<endl<<endl;
else
cout<<a[i];
}
cout<<endl<<endl;
}
return 0;
}
Problem1015
#include <stdio.h>
int main()
{
int n;
int i,j;
int y=0;
int x=0;
int z=1;
scanf("%d",&n);
int a[100][100];
for(i=0;i<n;i++)
{
a[i][0]=a[i-1][0]+y+z;
if(i<n-1)printf("%d ",a[i][0]);
else printf("%d\n",a[i][0]);
x=i+2;
if(n-i>=2){
for(j=1;j<n-i-1;j++)
{
a[i][j]=a[i][j-1]+x;
x=x+1;
printf("%d ",a[i][j]);
}
a[i][j]=a[i][j-1]+x;
printf("%d",a[i][j]);
printf("\n");}
// else printf("\n");
y=y+1;
z=0;
}
return 0;
}
Problem1040
#include <stdio.h>
int main(){
printf("**************************\n");
printf(" Very Good!\n");
printf("**************************\n");
return 0;
}
Problem1041
#include "stdio.h"
main()
{
int a,b,c,max;
scanf("%d%d%d",&a,&b,&c);
if(a>b){
if(a>c){
max=a;
}
else max=c;
}
else {
if(b>c)max=b;
else max=c;
}printf("%d",max);
}
Problem1042
#include<stdio.h>
main()
{
char a,b,c,d,e;
scanf("%c%c%c%c%c",&a,&b,&c,&d,&e);
char c1,c2,c3,c4,c5;
c1=a+4;
c2=b+4;
c3=c+4;
c4=d+4;
c5=e+4;
printf("%c%c%c%c%c",c1,c2,c3,c4,c5);
}
Problem1043
#include<stdio.h>
int main()
{float h,r,C1,Sa,Sb,Va,Vb;
float pi=3.14;
scanf("%f %f",&r,&h);
C1=2*pi*r;
Sa=r*r*pi;
Sb=4*pi*r*r;
Va=4.0/3*pi*r*r*r;
Vb=pi*r*r*h;
printf("C1=%4.2f\nSa=%4.2f\nSb=%4.2f\nVa=%4.2f\nVb=%4.2f\n",C1,Sa,Sb,Va,Vb);
return 0;
}
Problem1044
#include "stdio.h"
main()
{
float c,F;
scanf("%f",&F);
c=(5*(F-32))/9;
printf("c=%.2f",c);
return 0;
}
Problem1045
#include "stdio.h"
main()
{
int a,b,c,max;
scanf("%d%d%d",&a,&b,&c);
if(a>b){
if(a>c){
max=a;
}
else max=c;
}
else {
if(b>c)max=b;
else max=c;
}printf("%d",max);
}
Problem1046
#include "stdio.h"
main()
{
int x,y;
scanf("%d",&x);
if(x<1){
y=x;
}
if(x<10&&x>1){
y=2*x-1;
}
if(x>=10){
y=3*x-11;
}
printf("%d",y);
return 0;
}
Problem1047
#include "stdio.h"
main()
{
int s;
s<=100&&s>=0;
scanf("%d",&s);
if(s>=90)
printf("A");
else if(s>=80)
printf("B");
else if(s>=70)
printf("C");
else if(s>=60)
printf("D");
else if(s<60)
printf("e");
return 0;
}
Problem1048
#include <stdio.h>
int main(){
int a,b,c,d,e,f;
a<99999;
scanf("%d",&a);
if(a/10000!=0){
b=a/10000,c=(a%10000)/1000,d=(a%1000)/100,e=(a%100)/10,f=(a%10);
printf("5\n");
printf("%d %d %d %d %d\n",b,c,d,e,f);
printf("%d%d%d%d%d",f,e,d,c,b);
}
else if(a/1000!=0){
c=(a%10000)/1000,d=(a%1000)/100,e=(a%100)/10,f=(a%10);
printf("4\n");
printf("%d %d %d %d\n",c,d,e,f);
printf("%d%d%d%d",f,e,d,c);
}
else if(a/100!=0){
d=(a%1000)/100,e=(a%100)/10,f=(a%10);
printf("3\n");
printf("%d %d %d\n",d,e,f);
printf("%d%d%d",f,e,d);
}
else if(a/10!=0){
e=(a%100)/10,f=(a%10);
printf("2\n");
printf("%d %d\n",e,f);
printf("%d%d",f,e);
}
else {
f=(a%10);
printf("1\n");
printf("%d\n",f);
printf("%d",f);
}
return 0;
}
Problem1049
#include <stdio.h>
int main(){
double a,b;
scanf("%lf",&a);
if(a<=100000){
b=a*0.1;
}
else if(a>100000&&a<=200000){
b=10000+(a-100000)*0.075;
}
else if(a>200000&&a<=400000){
b=17500+(a-200000)*0.05;
}
else if(a>400000&a<=600000){
b=27500+(a-400000)*0.03;
}
else if(a>600000&a<=1000000){
b=33500+(a-600000)*0.015;
}
else if(a>1000000){
b=36500+(a-1000000)*0.01;
}
printf("%.0lf",b);
return 0;
}
Problem1050
#include<stdio.h>
main()
{
int a,b,c,n,m;
scanf("%d%d",&n,&m);
if(m<n)
{
a=m;
m=n;
n=a;
}
c=n*m;
while(n!=0)
{
b=m%n;
m=n;
n=b;
}
printf("%d %d",m,c/m);
}
Problem1051
#include "stdio.h"
main()
{
char c;
int letters=0,space=0,digit=0,others=0;
while((c=getchar())!='\n')
{
if(c>='a'&&c<='z'||c>='A'&&c<='Z')
letters++;
else if(c==' ')
space++;
else if(c>='0'&&c<='9')
digit++;
else
others++;
}
printf("%d %d %d %d\n",letters,
digit,space,others);
return 0;
}
Problem1052
#include "stdio.h"
main()
{
int a=2,n,count=1;
int sn=0,tn=0;
scanf("%d",&n);
while(count<=n)
{
tn=tn+a;
sn=sn+tn;
a=a*10;
++count;
}
printf("%d",sn);
}
Problem1053
#include <stdio.h>
double fact(int k)
{
long long int res = 1.0;
while (k>=1)
{
res *= k;
k--;
}
return res;
}
int main()
{
long long int sum=0;
int i,n;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
sum+=fact(i);
}
printf("%lld\n",sum);
return 0;
}
Problem1054
#include <stdio.h>
int main(){
double a,b,c,d=0,e=0,f=0,i,n;
scanf("%lf%lf%lf",&a,&b,&c);
for(i=1;i<=a;i++){
d+=i;
}
for(i=1;i<=b;i++){
e+=i*i;
}
for(i=1;i<=c;i++){
f+=1/i;
}
n=d+e+f;
printf("%.2lf",n);
}
Problem1055
#include "stdio.h"
int main()
{
int i,a,b,c;
for(i=100;i<1000;i++){
a=i/100;
b=(i%100)/10;
c=i%10;
if(a*a*a+b*b*b+c*c*c==i)
printf("%d\n",i);
}
return 0;
}
Problem1056
#include<stdio.h>
int main(){
int m,s,i,N;
scanf("%d",&N);
for (m=2;m<N;m++)
{s=0;
for(i=1;i<m;i++)
if((m%i)==0)s=s+i;
if(s==m)
{printf("%d its factors are ",m);
for(i=1;i<m;i++)
if (m%i==0)
printf("%d ",i);
printf("\n");
}
}
return 0;
}
Problem1057
#include<stdio.h>
int main(){
int i,n;
scanf("%d",&n);
double a=2,b=1,s=0,t;
for(i=1;i<=n;i++)
{
s=s+a/b;
t=a,
a=a+b,
b=t;
}
printf("%5.2f\n",s);
return 0;
}
Problem1058
#include<stdio.h>
int main(){
int M,N;
scanf("%d %d",&M,&N);
double s=M,h=s/2.0;
float n;
for(n=2.0;n<=N;n++)
{s=s+2.0*h;
h=h/2.0;
}
printf("%3.2f",h);
printf(" ");
printf("%3.2f\n",s);
return 0;
}
Problem1059
#include <stdio.h>
int main(){
int i,j=1,n,sum=1;
scanf("%d",&n);
for(i=1;i<n;i++){
j=(j+1)*2;
}
printf("%d",j);
return 0;
}
Problem1060
#include <stdio.h>
#include <math.h>
double cal_sqrt(double a)
{
double x=1;
double y=1.0/2*(x+a/x);
while(fabs(y-x)>1e-5)
{
x=y;
y=1.0/2*(x+a/x);
}
return y;
}
int main()
{
double a;
scanf("%lf",&a);
double b=cal_sqrt(a);
printf("%.3lf",b);
return 0;
}
Problem1061
#include<stdio.h>
int main (){
int n,i,j,k,t,a ,b,s[100];
while (scanf ("%d",&n)!=EOF) {
t=0;
if (n==2)
printf ("2\n");
else {
for (j=2;j<n;j++){
b = 0;
for (i=2;i<j;i++){
a=j%i;
if (a==0){
b=1;
break;}}
if (b!=1){
s[t]=j;
t++; } }
for (k=0;k<t;k++){
printf ("%d\n",s[k]);} } }
return 0;
}
Problem1061
#include "stdio.h"
#include "math.h"
main()
{
int m,i,k,n;
scanf("%d",&n);
for(m=2;m<=n;m++)
{
k=sqrt(m+1);
for(i=2;i<=k;i++)
if(m%i==0)
break;
if(i>k)
printf("%d\n",m);
}return 0;}
Problem1062
#include <stdio.h>
int main()
{
int a[10];
int i,j,t;
for ( i = 0; i < 10; i ++ ) scanf("%d",&a[ i ]);
for ( i = 0; i < 9; i ++ )
for ( j = i + 1; j < 10; j ++)
if ( a[ i ] > a[ j ] ) { t = a[ i ]; a[ i ] = a[ j ]; a[ j ] = t; }
for( i = 0; i < 10; i ++) printf("%d\n",a[ i ]);
return 0;
}
Problem1063
#include <stdio.h>
int main()
{
int i,j;
int sum1 = 0,sum2=0;
int a[3][3];
for(i = 0;i < 3;i++){
for(j=0;j<3;j++){
scanf("%d",&a[i][j]);
}
}sum1 =a[0][0]+a[1][1]+a[2][2];
sum2=a[2][0]+a[1][1]+a[0][2];
printf("%d %d\n",sum1,sum2);
}
Problem1064
#include<stdio.h>
int main()
{
int a[10];
int i,j,x,t;
for(i=0;i<9;i++)
scanf("%d",&a[i]);
scanf("%d",&x);
for(i=0;i<9;i++)
if(x<a[i]) break;
for(j=9;j>i;j--)
a[j]=a[j-1];
a[j]=x;
for(i=0;i<10;i++)
printf("%d\n",a[i]);
}
Problem1065
#include <stdio.h>
#include <string.h>
int main(){
char c1[100];
int i;
gets(c1);
char c2[strlen(c1)];
for(i=0;i<=strlen(c1);i++){
c2[i]=c1[strlen(c1)-i-1];
}
puts(c2);
}
Problem1066
#include<stdio.h>
#include<math.h>
int main()
{
int a,b,i,t,s;
scanf("%d%d",&a,&b);
if(a>b){
for(i=1;i<=b;i++){
if(a%i==0&&b%i==0)
t=i;
}
s=a*b/t;
}
else
{
for(i=1;i<=a;i++){
if(a%i==0&&b%i==0)
t=i;
}
s=a*b/t;
}
printf("%d %d",t,s);
}
Problem1067
#include <stdio.h>
#include <math.h>
void two(float a,float b,float c){
float x1=(-b+sqrt(b*b-4*a*c))/(2*a);
float x2=(-b-sqrt(b*b-4*a*c))/(2*a);
printf("x1=%.3f x2=%.3f\n",x1,x2);
}
void one(float a,float b,float c){
float x=-b/(2*a);
printf("x1=x2=%.3f\n",x);
}
void zore(float a,float b,float c){
float x=-b/(2*a);
float i1=sqrt(4*a*c-b*b)/(2*a);
float i2=-sqrt(4*a*c-b*b)/(2*a);
printf("x1=%.3f+%.3fi x2=%.3f%.3fi\n",x,i1,x,i2);
}
int main(){
float a,b,c;
scanf("%f %f %f",&a,&b,&c);
int s = b*b-4*a*c;
if (s>0)
two(a,b,c);
else if(s==0)
one(a,b,c);
else
zore(a,b,c);
}
Problem1068
#include<stdio.h>
#include<math.h>
int main()
{
int i,t,n;
scanf("%d",&n);
t=sqrt(n);
for(i=2;i<=t;i++)
if(n%i==0)
break;
if(i>t) printf("prime");
else printf("not prime");
}
Problem1069
#include<stdio.h>
#include<math.h>
int main()
{
int t,i,j,a[3][3];
for(i=0;i<3;i++){
for(j=0;j<3;j++)
scanf("%d",&a[i][j]);
}
for(i=0;i<3;i++){
for(j=0;j<i;j++){
t=a[i][j],a[i][j]=a[j][i],a[j][i]=t;
}
}
for(i=0;i<3;i++){
for(j=0;j<3;j++){
printf("%d ",a[i][j]);}
printf("\n");
} }
Problem1070
#include <stdio.h>
#include <string.h>
int main()
{
char a[100];
int i,len;
for(i=0;;i++)
{
scanf("%c",&a[i]);
if(a[i]==' ')
break;
}
len =(int) strlen(a);
for(i=len-2;i>=0;i--)
printf("%c",a[i]);
return 0;
}
Problem1071
#include <stdio.h>
#include <string.h>
int main(){
char c1[10],c2[10];
gets(c1);
gets(c2);
strcat(c1,c2);
printf("%s\n",c1);
return 0;
}
Problem1072
#include <stdio.h>
#include <string.h>
int main()
{
char a[100],b[100],c[100];
int i,j=0;
gets(a);
for(i=0;i<=strlen(a);i++){
if(a[i]=='a'||a[i]=='e'||a[i]=='i'||a[i]=='o'||a[i]=='u')
b[j++]=a[i];
}strcpy(c,b);
puts(c);
}
Problem1073
#include <stdio.h>
int main()
{
int n,s,m,q,r;
n>=1000&&n<100000;
scanf("%d",&n);
s=n/1000;
m=(n%1000)/100;
q=(n%100)/10;
r=n%10;
printf("%d %d %d %d",s,m,q,r);
return 0;
}
Problem1074
#include<stdio.h>
#include<string.h>
int alph,digit,space,others;
void count(char str[]);
void main(void) { char text[80];
gets(text);
strcat(text,"\n");
alph=0; digit=0;
space=0; others=0; count(text);
printf("%d %d %d %d ",alph,digit,space,others); }
void count(char str[]) { int i;
for(i=0;str[i]!='\n';i++) {
if((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z'))
alph++;
else if(str[i]>='0'&&str[i]<='9')
digit++;
else if(str[i]==' ')
space++;
else
others++;
} }
Problem1075
#include <stdio.h>
#define T(a,b) {int c;c=a;a=b;b=c;}
int main()
{
int x,y;
scanf("%d %d",&x,&y);
T(x,y);
printf("%d %d",x,y);
return 0;
}
Problem1076
#include <stdio.h>
#define T(a,b) ((a)%(b))
int main()
{
int x,y;
scanf("%d %d",&x,&y);
printf("%d",T(x,y));
return 0;
}
Problem1077
#include <stdio.h>
#include <math.h>
#define S(a,b,c)((a+b+c)/2)
#define area(a,b,c,S) (sqrt(S*(S-a)*(S-b)*(S-c)))
int main()
{
double x,y,z;
scanf("%lf %lf %lf",&x,&y,&z);
printf("%.3lf",area(x,y,z,S(x,y,z)));
return 0;
}
Problem1078
#include <stdio.h>
#include <math.h>
#define S(y)(y%4==0&&(y%400==0||y%100!=0))
int main()
{
int z;
scanf("%d",&z);
if(S(z))
printf("L");
else printf("N");
return 0;
}
Problem1079
#include <stdio.h>
int main() {
float a;
scanf("%f",&a);
printf(" %.2f\n",a);
printf(" %.2f %.2f\n",a,a);
printf(" %.2f %.2f %.2f\n",a,a,a);
return 0;
}
Problem1080
#include<stdio.h>
#define max1(a,b,c) ((a)>(b)?(a):(b))>(c)?((a)>(b)?(a):(b)):(c)//巨集定義求最大值
double max(double x,double y,double z)
{
double max1;
double a=y>z?y:z;
max1=x>a?x:a;
return max1;
}
int main()
{
double a,b,c;
scanf("%lf%lf%lf",&a,&b,&c);
printf("%.3lf\n",max(a,b,c));
printf("%.3lf",max1(a,b,c));
getchar();
return 0;
}
Problem1081
#include <stdio.h>
#include <string.h>
main()
{
char a[100];
int i,n;
gets(a);
n=strlen(a);
for(i=0;i<n;i++)
{
if(a[i]>='a'&&a[i]<'z')
printf("%c",a[i]+1);
else if(a[i]=='z')
printf("a");
else if(a[i]==' ')
printf(" ");
else
printf("%c",a[i]);
}
}
Problem1082
#include<stdio.h>
int main()
{
int a[3],i,j;
for(i=0;i<3;i++)
scanf("%d",&a[i]);
for(i=0;i<2;i++)
for(j=0;j<3-i-1;j++)
{
if(a[j]>a[j+1]){
int p;
p=a[j];
a[j]=a[j+1];
a[j+1]=p;
}
}
for(i=0;i<3;i++)
printf("%d ",a[i]);
return 0;
}
Problem1083
#include<stdio.h>
#include<string.h>
main()
{
char s1[100],s2[100],s3[100],s4[100];
gets(s1);//printf("\n");
gets(s2);//printf("\n");
gets(s3);//printf("\n");
if (strcmp(s1,s2)>0)
{
strcpy(s4,s1);
strcpy(s1,s2);
strcpy(s2,s4);
}
if (strcmp(s1,s3)>0)
{
strcpy(s4,s1);
strcpy(s1,s3);
strcpy(s3,s4);
}
if (strcmp(s2,s3)>0)
{
strcpy(s4,s2);
strcpy(s2,s3);
strcpy(s3,s4);
}
printf("%s\n%s\n%s\n",s1,s2,s3);
}
Problem1084
#include <stdio.h>
main(){
int a[10],i,temp,max,min;
for(i=0;i<10;i++)
scanf("%d",&a[i]);
for(i=0;i<10;i++)
{
min=i;
for(i=0;i<10;i++)
{
if(a[min]>a[i])
{
min=i;
}
}
temp=a[0],a[0]=a[min],a[min]=temp;
}
for(i=0;i<10;i++)
{
max=i;
for(i=0;i<10;i++)
{
if(a[max]<a[i])
{
max=i;
}
}
temp=a[9],a[9]=a[max],a[max]=temp;
}
for(i=0;i<10;i++){
printf("%d ",a[i]);
}
printf("\n");
}
Problem1085
#include <stdio.h>
#include <math.h>
int main()
{
int n,i;
scanf("%d",&n);
int a[20],*c[20];
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
int b;
scanf("%d",&b);
for(i=0;i<n;i++)
{
if(i+b<n)
c[i+b]=&a[i];
else c[i+b-n]=&a[i];
}
for(i=0;i<n;i++)
printf("%d ",*c[i]);
}
Problem1086
#include <iostream>
using namespace std;
int main()
{ int i,j,n,m,k,*p,num[100];k=m=0;
cin>>n;
p=num;
for(i=0;i<n;i++)
*(p+i)=i+1;
i=0;
while(m<n-1)
{ if(*(p+i)!=0)
k++;
if(k==3)
{*(p+i)=0;
k=0;
m++;
}
i++;
if(i==n)
i=0;
}
while(*p==0)
p++;
cout<<*p<<endl;
return 0;
}
Problem1087
#include <stdio.h>
#include <string.h>
main()
{
int n,m,i;
char s1[200],s2[200];
scanf ("%d\n",&n);
for (i=0;i<n;i++)
scanf ("%c\n",&s1[i]);
scanf ("%d",&m);
for (i=0;i<n;i++)
s2[i]=s1[i+m-1];
for (i=0;i<n-m+1;i++)
printf("%c",s2[i]);
}
Problem1088
#include<stdio.h>
int main() {
int y,m,d,n=0;
scanf("%d %d %d",&y,&m,&d);
n=0;
int flag=0;
if((y%4==0&&y%100!=0)||(y%400==0))
flag=1;
int a[13]= {0,31,28,31,30,31,30,31,31,30,31,30,31};
if(flag==1)
a[2]=29;
int i;
for(i=1; i<m; i++) {
n+=a[i];
}
n+=d;
printf("%d",n);
return 0;
}
Problem1089
#include <iostream>
using namespace std;
struct student
{char num[100];
char name[100];
int a;
int b;
int c;
}stu[100];
void input(int N)
{for(int i=0;i<N;i++)
cin>>stu[i].num>>stu[i].name>>stu[i].a>>stu[i].b>>stu[i].c;
}
void output(int N)
{for(int i=0;i<N;i++)
cout<<stu[i].num<<','<<stu[i].name<<','<<stu[i].a<<','<<stu[i].b<<','<<stu[i].c<<endl;
}
int main()
{ int N;
cin>>N;
input(N);
output(N);
return 0;
}
Problem1090
#include <iostream>
using namespace std;
struct student
{char num[100];
char name[100];
int a;
int b;
int c;
int sum;
}stu[100];
void input(int N)
{for(int i=0;i<N;i++){
cin>>stu[i].num>>stu[i].name>>stu[i].a>>stu[i].b>>stu[i].c;
stu[i].sum=stu[i].a+stu[i].b+stu[i].c;}
}
int avg1(int N)
{
int avg=0;
for(int i=0;i<N;i++)
avg+=stu[i].a;
return avg/N;
}
int avg2(int N)
{
int avg=0;
for(int i=0;i<N;i++)
avg+=stu[i].b;
return avg/N;
}
int avg3(int N)
{
int avg=0;
for(int i=0;i<N;i++)
avg+=stu[i].c;
return avg/N;
}
void output(int N)
{
int max=0,pos=0;
for(int i=0;i<N;i++)
{
if(stu[i].sum>max)
{
max=stu[i].sum;
pos=i;
}
}
cout<<stu[pos].num<<' '<<stu[pos].name<<' '<<stu[pos].a<<' '<<stu[pos].b<<' '<<stu[pos].c;
}
int main()
{ int N;
cin>>N;
input(N);
printf("%d ",avg1(N));
printf("%d ",avg2(N));
printf("%d\n",avg3(N));
output(N);
return 0;
}
Problem1094
#include <iostream>
#include <string>
using namespace std;
int main()
{
int a,b,c,d;
string top[10]={" _ "," "," _ "," _ "," "," _ "," _ "," _ "," _ "," _ "},
mid[10]={"| |"," |"," _|"," _|","|_|","|_ ","|_ "," |","|_|","|_|"},
bot[10]={"|_|"," |","|_ "," _|"," |"," _|","|_|"," |","|_|"," _|"};
while(cin>>a>>b>>c>>d)
{
cout<<top[a]<<top[b]<<top[c]<<top[d]<<endl;
cout<<mid[a]<<mid[b]<<mid[c]<<mid[d]<<endl;
cout<<bot[a]<<bot[b]<<bot[c]<<bot[d]<<endl;
}
return 0;
}
Problem1120
#include <stdio.h>
#include <math.h>
int main(){
double sn=0;
int i,k;
scanf("%d",&k);
if(k>=1&&k<=15){
for(i=1;;i++){
sn=sn+1.0/i;
if(sn>k){
break;
}
}printf("%d",i);
}
}
Problem1162
#include <stdio.h>
int main() {
int i,j,k,n,m,l,q,b=1,a=1,c=1;
scanf("%d%d",&m,&n);
l=m-n;
for(i=1;i<=n;i++){
a=a*i;
}
for(j=1;j<=m;j++){
b=b*j;
}
for(k=1;k<=l;k++){
c=c*k;
}
q=b/(a*c);
printf("%d",q);
return 0;
}
Problem1162
#include <stdio.h>
int main() {
int m,n,i,t=1,s=1,q=1;
scanf("%d%d",&m,&n);
if(m>=n&&n>=0){
for(i=1;i<=m;i++){
t=i*t;
}
for(i=1;i<=n;i++){
s=i*s;
}
for(i=1;i<=m-n;i++){
q=q*i;
}
}
printf("%d",t/(s*q));
return 0;
}
Problem1163
#include<stdio.h>
main(){
char a[1000];
int b=0;
int i;
for(i=0;;i++){
scanf("%c",&a[i]);
if(a[i]==' '){
break;
}
if(a[i]=='$'){
b=b+1;
}
}
printf("%d",b);
}
Problem1164
#include<stdio.h>
int main(){
int i,n,x,sum=0;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&x);
if(x%2==0)
sum+=x;
}
printf("%d\n",sum);
}
Problem1165
#include <stdio.h>
#include <string.h>
int main()
{
char n;
int i;
char a[100];
scanf("%c",&n);
scanf("%s",a);
for(i=0;i<strlen(a);++i)
if(a[i]!=n)
printf("%c",a[i]);
printf("\n");
return 0;
}
Problem1166
#include <stdio.h>
#include <math.h>
int main() {
int n,i;
double m,y;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%lf",&m);
if(m<-2){
y=m*m-sin(m);
printf("%.2lf\n",y);}
else if(m>=-2&&m<=2){
y=pow(2,m)+m;
printf("%.2lf\n",y);}
else if (m>2) {
y=sqrt(m*m+m+1);
printf("%.2lf\n",y);}
}
return 0;
}
Problem1167
#include "stdio.h"
int main()
{
int i,n;
float min,max,a[20];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%f",&a[i]);
}
max=a[0];min=a[0];
for(i=1;i<n;i++)
{if(a[i]<min) min=a[i];
if(a[i]>max) max=a[i];}
printf("%.2f %.2f",max,min);
}
Problem1168
#include<stdio.h>
int main()
{
char c;
int z=0,k=0,s=0,q=0;
while ((c=getchar())!='\n')
{
if(c>='a'&&c<='z'||c>='A'&&c<='Z')
z++;
else if (c==' ')
k++;
else if (c>='0'&&c<='9')
s++;
else
q++;
}
printf("%d %d %d %d",z,s,k,q);
return 0;}
Problem1169
#include<stdio.h>
float fact(int k) {
float res = 1.0;
while (k>=1) {
res *= k; k--; }
return res; }
int main() {
double sum=0.0;
int i,n;
scanf("%d",&n);
for(i=1;i<=n;i++) {
sum+=1.0/fact(i); }
printf("%6.4f\n",sum);
return 0;
}
Problem1170
#include <stdio.h>
int main()
{
int i,a[10];
double sum=0,avg;
for(i=0;i<10;i++){
scanf("%d",&a[i]);
sum+=a[i];
}
avg=sum/10;
int t=0;
for(i=0;i<10;i++){
if(a[i]>avg)
++t;
}
printf("%d\n",t);
}
Problem1171
#include <stdio.h>
#include <math.h>
int main( )
{
int n,i;
int a,sum=0;
scanf("%d",&n);
scanf("%d",&a);
for( n=2; n<=a; ++n )
{
for( i = 2; i<=sqrt(n); i++)
if ( n % i == 0 )
break;
if ( i>sqrt(n) )
{ sum=sum+n;
}
}printf("%d\n", sum);
return 0;
}
Problem1172
#include "stdio.h"
#include "math.h"
main(){
int i,j,k,temp,a[10];
for(i=0;i<10;i++)
scanf("%d",&a[i]);
k=0;
for(j=k+1;j<10;j++)
if(abs(a[k])>abs(a[j]))
k=j;
temp=a[9];
a[9]=a[k];
a[k]=temp;
for(i=0;i<=9;i++)
printf("%d ",a[i]);
}
Problem1173
#include <math.h>
#include <stdio.h>
double fact(int n)
{
double fa =1;
while(n>0)
{
fa *= n;//階乘
n--;
}
return fa;
}
int main()
{
int n,i;
double sum =0;
double x;
scanf("%lf %d",&x,&n);
for( i = 1; i <= n; i++)
{
sum += ( pow(-1,i+1) * pow(x,i) / fact(i));
}
printf("%.4lf\n",sum);
return 0;
}
Problem1174
#include "stdio.h"
#include "math.h"
int main()
{
double x,y;
scanf("%lf",&x);
if(x<0)
{
y=fabs(x);
}
if(x<2&&x>=0)
{
y=sqrt(x+1);
}
if(x>=2&&x<4)
{
y=(x+2)*(x+2)*(x+2)*(x+2)*(x+2);
}
if(x>=4)
{
y=2*x+5;
}
printf("%.2lf",y);
}
Problem1175
#include <stdio.h>
ctof( int c , int f)
{
for(c=-100;c<=150;c+=5)
{ f = 32 + c* 9/5;
printf("c=%d->f=%d\n",c,f);}
}
int main()
{
int c,f;
ctof(c,f);
return 0;
}
Problem1176
#include "stdio.h"
#include "math.h"
int main()
{
int i,n,j,a[6][6],s,t,max;
scanf("%d",&n);
for(i=0;i<n;i++){
for(j=0;j<n;j++){
scanf("%d",&a[i][j]);
}
}
max=fabs(a[0][0]);
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(fabs(a[i][j])>max) {
max=a[i][j];
s=i+1;
t=j+1;
}
}
}printf("%d %d %d",max,s,t);
}
Problem1177
#include<stdio.h>
int main(){
int a[1000];
int y=0,t=0,b=0;
int i;
for(i=0;;i++){
scanf("%d",&a[i]);
if(a[i]<=0){
break;
}
if(a[i]>=85){
y=y+1;
}
if(a[i]>=60&&a[i]<=84){
t=t+1;
}
if(a[i]<60){
b=b+1;
}
}
printf(">=85:%d\n60-84:%d\n<60:%d",y,t,b);
}
Problem1178
#include <stdio.h>
double fact(int k){
double a=1;
int i;
for(i=1;i<=k;i++)
a=a*i;
return 1/a;
}
int main(){
int n;
double sum=0.0;
scanf("%d",&n);
int j;
for(j=1;j<=n;j++)
sum+=fact(j);
printf("sum=%.5lf",sum);
}
Problem1179
#include <stdio.h>
int main()
{
int d;
scanf("%d",&d);
printf("%o\n",d);
return 0;
}
Problem1179
#include <stdio.h>
int main()
{
int x;
scanf("%d",&x);
printf("%o\n",x);
return 0;
}
Problem1179
#include <stdio.h>
int main(){
int a,b;
scanf("%d",&a);
printf("%o",a);
return 0;
}
Problem1180
#include <stdio.h>
int main()
{
float a,b;
scanf("%f",&a);
b=5*(a-32)/9;
printf("%.2f\n",b);
return 0;
}
Problem1181
#include <stdio.h>
#include <math.h>
int main()
{
double x,y;
scanf("%lf",&x);
if(x<1){y=x;}
else if(1<=x && x<10 ){
y=2*x-1;}
else if(x>=10){
y=3*x-11;}
printf("%.2lf",y);
return 0;
}
Problem1182
#include <stdio.h>
int main() {
int i,n,a,sum=0;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&a);
if(a%2==0){
sum+=a;
}
}
printf("%d\n",sum);
return 0;
}
Problem1182
#include<stdio.h>
int main(){
int i,n,x,sum=0;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&x);
if(x%2==0)
sum+=x;
}
printf("%d\n",sum);
}
Problem1183
#include <stdio.h>
int main()
{
int sum=0,i,n,l=2;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
sum=sum+l;
l=l+3;
}
printf("%d",sum);
return 0;
}
Problem1184
#include <stdio.h>
main()
{
int i;
for(i=10;i<1001;i++)
{
if(i%7==0&&i%3==0&&i%2==0)
printf("%d\n",i);
}
}
Problem1185
#include<stdio.h>
int main(){
double i,n=20,ave,x,j=0,sum=0;
for(i=1;i<=n;i++){
scanf("%lf",&x);
if(x<0){
j++;
}
else
sum+=x;
} ave=sum/(20-j);
printf("%.0lf\n%.2lf\n",j,ave);
}
Problem1186
#include<stdio.h>
#include<math.h>
int main()
{
int a,b,i,t,s;
scanf("%d%d",&a,&b);
if(a>b){
for(i=1;i<=b;i++){
if(a%i==0&&b%i==0)
t=i;
}
s=a*b/t;
}
else
{
for(i=1;i<=a;i++){
if(a%i==0&&b%i==0)
t=i;
}
s=a*b/t;
}
printf("%d\n%d",t,s);
}
Problem1187
#include<stdio.h>
int main()
{
char c;
int z=0,k=0,s=0,q=0;
while ((c=getchar())!='\n')
{
if(c>='a'&&c<='z'||c>='A'&&c<='Z')
z++;
else if (c==' ')
k++;
else if (c>='0'&&c<='9')
s++;
else
q++;
}
printf("%d\n%d\n%d\n%d\n",z,k,s,q);
return 0;}
Problem1188
#include <stdio.h>
#include<math.h>
int main() {
int n;
double i=1,sum=0;
for(n=1;n<=30;n++){
i=i*n;
sum+=i;
}
printf("%.2e",sum);
return 0;
}
Problem1189
#include <stdio.h>
#include <string.h>
int main(){
int i,b,s,g;
for(i=100;i<1000;i++){
b=i/100,s=(i%100)/10,g=i%10;
if(i==b*b*b+s*s*s+g*g*g)
printf("%d\n",i);
}
return 0;
}
Problem1190
#include<stdio.h>
#include<math.h>
int isprime(int n)
{
int i;
for(i=2; i<=sqrt(n); i++)
{
if(n%i == 0)
{
return 0;
}
if(i>sqrt(n))
{
return 1;
}
}
return 1;
}
int main()
{
int i,m;
scanf("%d",&m);
for(i=2; i<=sqrt(m); i++)
{
if(m%i == 0)
{
if(isprime(i))
{
printf("%d ",i);
m /= i;
i = 1;
}
}
}
if(i>sqrt(m))
{
printf("%d ",m);
}
return 0;
}
Problem1191
#include <stdio.h>
int main()
{
int g, b, s ,g1,g2,s1,s2,b1,b2;
int x ,y ;
for(x=100;x<1000;x++){
for(y=100;y<1000;y++){
g1=x%10;b1=x/100;g2=y%10;b2=y/100;s1=(x%100)/10;s2=(y%100)/10;
if(x+y==1333&&g1==b2&&g2==b1&&s1==s2)
printf("%d+%d=1333\n", x,y);
}
}
return 0;
}
Problem1192
#include <stdio.h>
int main() {
int i,j,k,n;
scanf("%d",&n);
for(i=1;i<=n;i++){
for(j=1;j<=n-i;++j)
printf(" ");
for(k=1;k<=2*i-1;++k)
printf("*");
printf("\n");
}
return 0;
}
Problem1193
#include<stdio.h>
int main(){
long int i,j,m;
for(j=2;j<=1000;j++)
{
m=0;
for(i=1;i<j;i++)
if(j%i==0)
m+=i;
if(m==j)
{
printf("%d=1",j);
for(i=2;i<j;i++)
if(j%i==0)
printf("+%d",i);
printf("\n");
}
}
}
Problem1194
#include <stdio.h>
#define PI 3.1416
int main()
{
int n,r;
for(r=1;r<=10;r++){
double s=PI*r*r;
if(s>40&&s<90)
printf("r=%d area=%.2lf\n",r,s);
}
return 0;
}
Problem1195
#include <stdio.h>
int main()
{
int r,a[10];
for(r=0;r<10;r++)
scanf("%d",&a[r]);
int i,j;
for(i=0;i<10-1;i++)
for(j=0;j<10-1-i;j++){
if(a[j]>a[j+1]){
int t;
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
for(i=0;i<10;i++)
printf("%d\n",a[i]);
return 0;
}
Problem1195
#include<stdio.h>
int main() {
int a[10],i,j,t;
for(i=0; i<10; i++)
scanf("%d",&a[i]);
for(i=0; i<10; i++)
for(j=i+1; j<10; j++)
if (a[i]>a[j]) {
t=a[i];
a[i]=a[j];
a[j]=t;
}
for(i=0; i<10; i++)
printf("%d\n",a[i]);
return 0;
}
Problem1196
#include <stdio.h>
int main(){
int i,j,a[20];
for(i=0;i<20;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<20;i++)
for(j=0;j<20;j++)
{
if(a[i]!=a[j]&&a[i]%a[j]==0){
printf("%d\n",a[i]);
break;}
}
return 0;
}
Problem1197
#include <stdio.h>
int main()
{
int a[3][3];
int i,j,sum1=0,sum2=0;
for(i=0;i<3;i++){
for(j=0;j<3;j++){
scanf("%d",&a[i][j]);
}
sum1+=a[i][i];
}
printf("%d",sum1);
}
Problem1198
#include <stdio.h>
int main()
{
int a[6],b[8];
int i,j,sum1=0,sum2=0;
for(i=0;i<6;i++)
scanf("%d",&a[i]);
for(j=0;j<8;j++)
scanf("%d",&b[j]);
for(i=0;i<6;i++)
for(j=0;j<8;j++){
if(a[i]==b[j])
printf("%d\n",a[i]);
}
}
Problem1198
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
int i;
int m=6,n=8;
int a[100]={0};
int b[100]={0};
for(i=0;i<m;i++) //輸入a
cin>>a[i];
for(i=0;i<n;i++)//輸入b
cin>>b[i];
vector<int> v(m+n);
vector<int>::iterator it;
sort (a,a+m);
sort (b,b+n);
it =set_intersection (a,a+m,b,b+n,v.begin());
if(int(it-v.begin())==0)
cout<<endl;
else
for(i=0;i<int(it-v.begin());i++)
cout<<v[i]<<endl;
return 0;
}
Problem1201
#include<iostream>
using namespace std;
int main(){
bool day[63]={0};
int i,k,s;
for(i=1,k=1;i<63;k++,i+=k)
day[i]=1;
while(scanf("%d/%d",&i,&k),i!=0 && k!=0){
s=0;
if(i==8)
k+=31;
for(;k<63;k++)
if(day[k]) s++;
cout<<s<<endl;
}
return 0;
}
Problem1202
#include <stdio.h>
int main()
{
int m,n,t,g;
while(scanf("%d%d",&n,&m)!=EOF){
if(m==0&&n==0){
break;
}
if((m)%2==0&&m>0&&n>0){
t=(m-2*n)/2;
g=n-t;
if(t+g==n&&t>=0&&g>=0)
printf("%d %d\n",g,t);
else printf("Error\n");
}
else printf("Error\n");
}
return 0;}
Problem1203
#include <iostream>
using namespace std;
int main()
{
int a[1000]= {},b[1000]= {},i,j,win=0,n,t,k;
while(cin>>n&&n!=0)
{
for(j=0; j<n; j++)
cin>>a[j];
for(j=0; j<n; j++)
cin>>b[j];
for(j=0; j<n-1; j++)
for(i=0; i<n-1-j; i++)
{
if(a[i]>a[i+1])
{
t=a[i];
a[i]=a[i+1];
a[i+1]=t;
}
}
for(j=0; j<n-1; j++)
for(i=0; i<n-1-j; i++)
{
if(b[i]>b[i+1])
{
k=b[i];
b[i]=b[i+1];
b[i+1]=k;
}
}
for(i=0,j=0,win=0; i<n; i++)//都從第一個開始比較 示例 ，
{
if(a[i]>b[j]) //2 3 3 4 5
{ //1 2 3 4 5
// cout<<i<<endl; //2>1, 3>2,3!>3(這裡需要找後面的>3的數4>3),5>4,b[]的最後一項則無需比較了
win++;
j++;
// cout<<j<<endl;
}
}
if(win>n/2)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
}
return 0;
}
Problem1206
#include <stdio.h>
int main()
{
int n,a1,a2,a3,i;
while (scanf("%d", &n)==1 && n!=0){
a1=1;
a2=2;
if (n==1)a3=1;
else
if(n==2)a3=2;
else {
for(i=1;i<(n-1);i++)
{
a3=a1+a2;
a1=a2;
a2=a3;
}
}
printf("%d\n",a3);
}
return 0;
}
Problem1207
#include <iostream>
#include <cstdio>
using namespace std;
char a[26]={'E','C','F','A','J','K','L','B','D','G','H','I','V','W','Z','Y','M','N','O','P','Q','R','S','T','U','X'};
char b[26]={'e','r','w','q','t','y','g','h','b','n','u','i','o','p','s','j','k','d','l','f','a','z','x','c','v','m'};
int main()
{
char c;
while ((c=getchar())!='#')
{
if (c>='A'&&c<='Z')
putchar(a[c-65]);
else if(c>='a'&&c<='z')
putchar(b[c-97]);
else if(c==' ')
putchar(' ');
else if (c=='\n')
cout<<endl;
}
return 0;
}
Problem1208
#include <stdio.h>
#include <string.h>
#define LEN 1000+10
void turn_right(char *c,int *a,int k)//順時針旋轉
{
int i;
char temp;
temp=c[a[k-1]];
for(i=0;i<k-1;i++)
c[a[k-1-i]]=c[a[k-2-i]];
c[a[0]]=temp;
}
void turn_left(char *c,int *a,int k)//逆時針旋轉
{
int i;
char temp;
temp=c[a[0]];
for(i=0;i<k-1;i++)
c[a[i]]=c[a[i+1]];
c[a[k-1]]=temp;
}
int main()
{
char c[LEN];
int a[LEN]={0};
int len;
int i,j,k=0;
while(gets(c))
{
len=strlen(c);
for(i=len;i>=1;i--)
{
k=0;
memset(a,0,sizeof(a));
for(j=i;j<=len;j+=i) //儲存需要旋轉的字元的編號 直接讀完超時
a[k++]=j-1;
if(k==1)
continue;
if(i%2==0)
turn_right(c,a,k);
else
turn_left(c,a,k);
}
puts(c);
}
return 0;
}
Problem1234
#include <stdio.h>
#include <string.h>
int main()
{
char a[10000]={0};
while(gets(a))
{
int flag=0;
for(int i=0;i<strlen(a);i++)
{
if((a[i]=='s'||a[i]=='S')&&(a[i+1]=='a'||a[i+1]=='A')&&(a[i+2]=='l'||a[i+2]=='L')&&(a[i+3]=='t'||a[i+3]=='T'))
{
flag=1;
break;
}
}
if(flag)
puts(a);
}
return 0;
}
Problem1235
#include <stdio.h>
#include <string.h>
int main()
{
char a[10000]={0};
while(gets(a))
{
for(int i=0;i<strlen(a);i++)
{
if((a[i]=='s'||a[i]=='S')&&(a[i+1]=='a'||a[i+1]=='A')&&(a[i+2]=='l'||a[i+2]=='L')&&(a[i+3]=='t'||a[i+3]=='T'))
{
printf("soy sauce");
i=i+3;
}
else printf("%c",a[i]);
}
printf("\n");
}
return 0;
}
Problem1241
#include <iostream>
#include <math.h>
using namespace std;
int main()
{
double x,y,x1,y1,x2,y2;
cin>>x>>y;
cin>>x1>>y1;
cin>>x2>>y2;
double a,a1,a2;
a=sqrt((x-x1)*(x-x1)+(y-y1)*(y-y1));
a1=sqrt((x-x2)*(x-x2)+(y-y2)*(y-y2));
a2=sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
double s=(a+a1+a2)/2;
double area;
area=sqrt(s*(s-a)*(s-a1)*(s-a2));
printf("%.4lf",area);
return 0;
}
Problem1243
#include<stdio.h>
int main()
{
int i,b,a,c[100],sum=0,ff=0;
scanf("%d",&a);
for(i=1;i<=a;i++)
while(scanf("%d",&b)!=EOF)
{ ff=0;sum=0;
for(i=0;i<b;i++)
{scanf("%d",&c[i]);
if(c[i]<0||c[i]>100)
{ff++;}
else if(c[i]<60&&c[i]>=0)
{sum++;}
}
if(ff!=0)
printf("-1\n");
else
printf("%d\n",sum);}
return 0;}
Problem1265
#include<stdio.h>
int main()
{
int a1,b1,c1,d1,e,f,g,h,a2,b2,c2,d2,n,a3,b3,c3,d3,a4,b4,c4,d4;
scanf("%d.%d.%d.%d",&a1,&b1,&c1,&d1);
scanf("%d.%d.%d.%d",&e,&f,&g,&h);
a3=a1&e;b3=b1&f;c3=c1&g;d3=d1&h;
scanf("%d",&n);
while(n--)
{
scanf("%d.%d.%d.%d",&a2,&b2,&c2,&d2);
a4=a2&e;b4=b2&f;c4=c2&g;d4=d2&h;
if((a3==a4)&&(b3==b4)&&(c3==c4)&&(d3==d4))
{
printf("INNER\n");
}
else
{
printf("OUTER\n");
}
}
return 0;
}
Problem1288
#include<stdio.h>
int main() {
int a,b;
while(scanf("%d %d",&a,&b)!=EOF)
printf("%d",a+b);
return 0;
}
Problem1317
#include <stdio.h>
int main()
{
float a,b;
int t=0;
while(scanf("%f%f",&a,&b)!=EOF){
t=0;
while(a<=b)
{
a=a+a*0.1;
t++;
}
printf("%d\n",t);
}
return 0;
}
Problem1342
#include <stdio.h>
int main() {
int i,a;
int flag;
scanf("%d",&a);
while(scanf("%d",&i)==1) {
if(a<=i){
a=i;
flag=1;}
else {
flag=0;
break;
}
}
if(flag==1)
printf("YES\n");
else printf("NO\n");
return 0;}
Problem1344
#include <stdio.h>
int main()
{
int a,b,c,d;
int e,f;
scanf("%d%d",&a,&b);
scanf("%d%d",&c,&d);
printf("%d %d",a+c,b+d);
return 0;
}
Problem1345
#include <stdio.h>
#define ii -1
int main()
{
int a,b,c,d;
scanf("%d%d",&a,&b);
scanf("%d%d",&c,&d);
printf("%d %d",a*c+(b*d)*(ii),b*c+a*d);
return 0;
}
Problem1349
#include<stdio.h>
#include<math.h>
int main()
{
double a,b,c,x1,x2;
scanf("%lf %lf %lf",&a,&b,&c);
x1=(-b+sqrt(b*b-4*a*c))/(2*a);
x2=(-b-sqrt(b*b-4*a*c))/(2*a);
if(x1>=x2)
printf("%.2f %.2f\n",x1,x2);
else
printf("%.2f %.2f\n",x2,x1);
return 0;
}
Problem1350
#include <stdio.h>
#include <string.h>
int main()
{
char a[80];
int i;
gets(a);
for(i=0;i<=strlen(a);i++){
if(a[i]>='a'&&a[i]<='z'||a[i]>='A'&&a[i]<='Z')
printf("%c",a[i]);
}
return 0;
}
Problem1359
#include<stdio.h>
int main()
{
int y,m,d,n=0;
while(scanf("%d %d %d",&y,&m,&d)!=EOF){
n=0;
int flag=0;
if((y%4==0&&y%100!=0)||(y%400==0))
flag=1;
int a[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
if(flag==1)
a[2]=29;
int i;
for(i=1;i<m;i++)
{
n+=a[i];
}
n+=d;
printf("%d\n",n);}
return 0;
}
Problem1360
#include <stdio.h>
int main ()
{
int a,b;
while(scanf("%X%X",&a,&b)!=EOF)
printf("%X\n",a+b);
return 0;
}
Problem1362
#include<stdio.h>
#include<string.h>
int main()
{
int n,i,j,a[1001];
char c;
while(scanf("%d",&n)!=EOF)
{
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0+'A';i<=0+'Z';i++)
{
for(j=0;j<n;j++)
{
c=a[j]^i;
if(c<'A'||c>'Z')
break;
}
if(j==n) break;
}
for(j=0;j<n;j++)
printf("%c",a[j]^i);
printf("\n");
}
return 0;
}
Problem1368
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
char str[500000];
char ss[10000][30] ;
int des[10000];
int main( )
{
while( gets( str ) && str[0] != '#' )
{
memset( des , 0 , sizeof( des ) ) ;
int count = 0 ;
int i = 0 ;
char *p = strtok( str , " " );
while( p != NULL )
{
strcpy( ss[i++] , p ) ;
p = strtok( NULL , " " ) ;
}
for( int j = 0 ; j < i ; j++ )
{
for( int k = j+1 ; k < i ; k++ )
if( strcmp( ss[j] , ss[k] ) == 0 )des[k] = 1;
}
for( int j = 0 ; j < i ; j++ )
if( des[j]== 0 )
count++ ;
printf("%d\n" , count ) ;
}
// system( "pause" );
return 0;
}
Problem1382
#include <stdio.h>
int main()
{
int n=0,x=0,i=0;
double max=0;
double a[100];
scanf("%d",&n);
while(n--)
{
scanf("%d",&x);
for(i=0;i<x;i++)
{
scanf("%lf",&a[i]);
}
for(i=0;i<x;i++)
{
if(a[i]>max)
max=a[i];
}
printf("%.2f\n",max);
}
return 0;
}
Problem1393
#include <stdio.h>
int main()
{
int a[1000],i,b,s;
scanf("%d",&b);
for(i=0;;i++){
scanf("%d",&a[i]);
if(a[i]==0)
break;
else {b^=a[i];
s=b;}
}
if(s!=0)
printf("%d",b);
return 0;
}
Problem1394
#include <stdio.h>
int main()
{
int a=0;
int i,c;
while(scanf("%d",&a)!=EOF){
int b=4;
if(a==0)break;
else for(i=1;i<a;i++)
b=b+2;
c=a*b;
printf("%d\n",c);
c=0; }
return 0;
}
Problem1407
#include <stdio.h>
int main() {
int i,n,min,max,x,num=0;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&x);
if(i==1){
max=min=x,num=i;
}else{
if(x<min) min=x,num=i;
}
}
printf("%d",num);
return 0;
}
Problem1413
#include <string.h>
#include <stdio.h>
int main()
{
char a[200];
char b[200];
gets(a);
gets(b);
int i,sum=0,sum1=0;
for(i=0;i<strlen(a);i++)
{
if(a[i]!=' ')
sum+=a[i]+0;
}
for(i=0;i<strlen(b);i++)
{
if(b[i]!=' ')
sum1+=b[i]+0;
}
printf("%s",sum>sum1?a:b);
}
Problem1414
#include <stdio.h>
#include <math.h>
int main()
{
int n,a[100]={0};
int t=0,i,j;
scanf("%d",&n);
if(n==1){
a[0]=1;
}
else if(n==2){
a[0]=1;
a[1]=1;
}
else {
a[0]=1;
a[1]=1;
for(i=2;i<n;i++){
a[i]=a[i-1]+a[i-2];
//printf("%d ",a[i]);
}//printf("\n");
}
for(i=2;i<n;i++){
int k=sqrt(a[i]+1);
for(j=2;j<=k;j++)
if(a[i]%j==0)
break;
if(j>k)
printf("%d\n",a[i]);
}
return 0;
}
Problem1417
#include <string.h>
#include <stdio.h>
int main()
{
int i,a[50];
a[0]=1;
a[1]=1;
for(i=2;i<=40;i++)
{
a[i]=a[i-1]+a[i-2];
}
int num;
while(scanf("%d",&num)!=EOF)
{
if(num==0)
break;
printf("%d\n",a[num-1]);
}
return 0;
}
Problem1418
#include <string.h>
#include <stdio.h>
int main()
{
int num;
double money=0.0;
while(scanf("%d",&num)!=EOF)
{
money=395*num;
if(money<1000) printf("0.00\n");
else if(money>=1000&&money<3000) printf("%.2lf\n",395-((money*0.9)/num));
else printf("%.2lf\n",395-((money*0.8)/num));
}
return 0;
}
Problem1421
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main()
{
string num;
while(cin>>num)
{
int flag=0,i;
for(i=num.length()-1;i>=0;i--)
{
if(num[i]!='0'){
flag=1;
break;}
}
if(flag){
for(int k=i;k>=0;k--)
cout<<num[k];
}
cout<<endl;
}
return 0;
}
Problem1425
#include <stdio.h>
#include <string.h>
int main() {
int n,i,j;
scanf("%d",&n);
while(n--) {
int t=0;
char a[100]= {0};
scanf("%s",a);
for(i=0; i<strlen(a); i++) {
if((int)(a[i])>=128||(int)(a[i])<0)
t++;
}
printf("%d\n",t/3);
}
return 0;
}
Problem1426
#include <stdio.h>
int main ()
{
int a,b,a1,b1;
while(scanf("%d%d",&a,&b)!=EOF){
if(a==0&&b==0)
break;
else {
a1=(b-a-a)/2;
b1=a-a1;
if((b-a-a)%2!=0||a1*4+b1*2!=b)
printf("NO\n");
else printf("%d %d\n",b1,a1);
}
}
return 0;
}
Problem1428
#include <iostream>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
while (n != 0 || m != 0) {
int flag = 0;
for(int i=0; i<n; i++) {
int x;
cin >> x;
if (flag)
cout << x;
else if (x < m)
cout << x;
else {
cout << m << ' ' << x;
flag = 1;
}
if (i != n-1)
cout << ' ';
}
if (!flag)
cout << ' ' << m;
cout << endl;
cin >> n >> m;
}
}
Problem1430
#include <stdio.h>
#include <stdlib.h>
int main()
{
int s = 1, h;
int i, j;
while(scanf("%d", &h)!=EOF){
printf("1\n");
for (i = 2; i <= h; s = 1, i++)
{
printf("1 ");
for (j = 1; j <= i - 2; j++)
printf("%d ", (s = (i - j) * s / j));
printf("1\n");
}
printf("\n");
}
return 0;
}
Problem1434
#include <stdio.h>
#include <math.h>
int main()
{
int n,i;
double area,s;
scanf("%d",&n);
for(i=0;i<n;i++)
{
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
if((a+b+c)%1==0&&a> 0&&b> 0&&c> 0&&a+b>c&&a+c>b&&b+c>a)
{
s=((a+b+c)/2.0);
area = (double)(sqrt(s * (s - a) * (s - b) * (s - c)));
printf("%.2f\n",area);
}
else printf("NO\n");
}
return 0;
}
Problem1435
#include <stdio.h>
int main() {
int a,b,i,n,num=0;
a<b;
while(1){
scanf("%d%d",&a,&b);
if(a == 0 && b == 0) break;
for(i=0; i<(b-a); ++i) {
n=a+i;
if(n%4==0&&n%100!=0||n%400==0)
++num;
}
printf("%d\n",num);}
return 0;
}
Problem1435
#include <stdio.h>
int main() {
int a,b,i,n,num=0;
a<b;
while(1){
scanf("%d%d",&a,&b);
if(a == 0 && b == 0) break;
for(i=0; i<(b-a); ++i) {
n=a+i;
if(n%4==0&&n%100!=0||n%400==0)
++num;
}
printf("%d\n",num);}
return 0;
}
Problem1437
#include <stdio.h>
#include <math.h>
int main()
{
int a,b,i;
while(scanf("%d%d",&a,&b)!=EOF)
{
int s1=0,s2=0;
for(i=a;i<=b;i++)
{
if(i%2!=0)
s2+=i*i*i;
else
s1+=i*i;
}
printf("%d %d\n",s1,s2);
}
return 0;
}
Problem1459
#include <stdio.h>
#include <math.h>
int main()
{
int i,n;
float a,b,s;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%f%f",&a,&b);
s=log(b)/log(a);
printf("%.2f\n",s);
}
return 0;
}
Problem1461
#include <stdio.h>
#include <string.h>
int main()
{
int n,i=0,j=0,s=0;
int x,y;
scanf("%d",&n);
for(s=0;s<n;s++)
{
int t=0,a[100]={0},c[100]={0};
scanf("%d",&x);
for(i=0;i<x;i++)
{
scanf("%d",&a[i]);
}
int b[100]={0};
scanf("%d",&y);
for(i=0;i<y;i++)
{
scanf("%d",&b[i]);
}
for(i=0;i<x;i++)
for(j=0;j<y;j++)
{
if(a[i]==b[j]){
c[t]=b[j];
t++;}
}
for(i=0;i<t-1;i++)
for(j=0;j<t-i-1;j++)
{
if(c[j]>c[j+1])
{
int q=c[j+1];
c[j+1]=c[j];
c[j]=q;
}
}
for(i=0;i<t-1;i++)
printf("%d ",c[i]);
printf("%d",c[i]);
printf("\n");
}
return 0;
}
Problem1462
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
int s,i;
cin>>s;
while(s--)
{
int m=0,n=0;
int a[100]={0};
int b[100]={0};
cin>>m;
for(i=0;i<m;i++) //輸入a
cin>>a[i];
cin>>n;
for(i=0;i<n;i++)//輸入b
cin>>b[i];
vector<int> v(m+n);
vector<int>::iterator it;
sort (a,a+m);
sort (b,b+n);
it =set_union (a,a+m,b,b+n,v.begin());
for(i=0;i<int(it-v.begin()-1);i++)
cout<<v[i]<<" ";
cout<<v[i];
cout<<endl;
}
return 0;
}
Problem1463
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
int s,i;
cin>>s;
while(s--)
{
int m=0,n=0;
int a[100]={0};
int b[100]={0};
cin>>m;
for(i=0;i<m;i++) //輸入a
cin>>a[i];
cin>>n;
for(i=0;i<n;i++)//輸入b
cin>>b[i];
vector<int> v(m+n);
vector<int>::iterator it;
sort (a,a+m);
sort (b,b+n);
it =set_difference (a,a+m,b,b+n,v.begin());
if(int(it-v.begin())==0)
cout<<endl;
else{
for(i=0;i<int(it-v.begin()-1);i++)
cout<<v[i]<<" ";
cout<<v[i];
cout<<endl;}
}
return 0;
}
Problem1465
#include <stdio.h>
#include <string.h>
int main()
{
int n,i=0,j=0,s=0;
int x,y;
scanf("%d",&n);
for(s=0;s<n;s++)
{
int t=0,a[100]={0},c[100]={0},r[100]={0},l=0;
scanf("%d",&x);
for(i=0;i<x;i++)
{
scanf("%d",&a[i]);
}
int b[100]={0};
scanf("%d",&y);
for(i=0;i<y;i++)
{
scanf("%d",&b[i]);
}
for(i=0;i<x;i++)
for(j=0;j<y;j++)
{
if(a[i]==b[j]){
c[t]=b[j];
t++;}
}
for(i=0;i<x;i++){
for(j=0;j<t;j++){
if(a[i]==c[j])
break;
}
if(j>=t){r[l]=a[i];
l++;
break;}
}
for(i=0;i<y;i++){
for(j=0;j<t;j++){
if(b[i]==c[j])
break;}
if(j>=t){r[l]=b[i];
l++;
break;}
}
for(i=0;i<l-1;i++)
for(j=0;j<l-i-1;j++)
{
if(r[j]>r[j+1])
{
int q=r[j+1];
r[j+1]=r[j];
r[j]=q;
}
}
if(l==0)
printf("\n");
else {for(i=0;i<l-1;i++)
printf("%d ",r[i]);
printf("%d",r[i]);
printf("\n");
}}
return 0;
}
Problem1466
#include<stdio.h>
#include<math.h>
int main()
{
int a,b,c,d;
scanf("%d",&d);
while(d--)
{
scanf("%d%d",&a,&b);
while(b)
{
c=a;
a=b;
b=c%b;
}
printf("%d\n",abs(a));
}
}
Problem1467
#include <stdio.h>
int main() {
double a;
while(scanf("%lf",&a)!=EOF) {
if(a==0)
break;
printf("%.0lf\n",a);
}
return 0;
}
Problem1468
#include <stdio.h>
#include <math.h>
int reverse(int a)
{ int i,j,k;
i=a/100;
j=(a%100)/10;
k=a%10;
if(a==i*i*i+j*j*j+k*k*k&&a>=100&&a<1000)
printf("Y\n");
else
printf("N\n");
}
int main (){
int n,i;
scanf("%d",&n);
for (i=0;i<n;i++)
{
int q;
scanf("%d",&q);
reverse(q);
}
}
Problem1470
#include <stdio.h>
int main()
{
int n;
scanf("%d",&n);
while(n--)
{
int h=0,m=0,s=0,s1=0;
scanf("%d%d%d%d",&h,&m,&s,&s1);
if(s1+s>=60){
m=m+(s1+s)/60;
s=(s1+s)%60;}
else s=s1+s;
if(m>=60){
h=h+m/60;
m=m%60;
}
else m=m;
if(h>=24){
h=h-24;
}
else h=h;
printf("%d:%d:%d\n",h,m,s);
}
return 0;
}
Problem1471
#include <stdio.h>
int main()
{
int a,i=0;
for(i=0;;i++)
{
scanf("%d",&a);
if(a==0)
break ;
else if(a%7!=0)
{
printf("%d\n",a);
}
}
return 0;
}
Problem1472
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main()
{
string num;
while(cin>>num&&num!="0")
{
int flag=0;
for(int i=num.length()-1;i>=0;i--)
{
if(num[i]!='0'||num[i-1]=='.')
flag=1;
if(flag)
cout<<num[i];
}
cout<<endl;
}
return 0;
}
Problem1473
#include <stdio.h>
int main()
{
int n,a,b,c,sum=0;
scanf("%d",&n);
while(n--)
{
sum=0;
scanf("%d%d%d",&a,&b,&c);
sum+=b/7;
if(b%7!=0)
{
b%=7;
b=a+b-1;
if((c>=a&&c<=b)||(c>=a-7&&c<=b-7))
sum++;
}
printf("%d\n",sum);
}
return 0;
}
Problem1512
#include <stdio.h>
#include <stdlib.h>
int main() {
int x,n,i,y,a;
scanf("%d%d",&x,&n);
a=x/3;
printf("%d",x-a);
printf(" %d\n",a);
for(i=1;i<=n;i++){
scanf("%d",&y);
if(y>0&&y<x){
if(y%3!=0)
printf("同志們好\n");
else
printf("同志們辛苦了\n");
}
else
printf("隊伍編號越界\n");
}
return 0;
}
Problem1520
#include <stdio.h>
int main()
{
int i,n;
while(1){
scanf("%d",&n);
if(n==0) break;
else{
double a[100],sum=0.0;
for(i=0;i<n;i++)
{
scanf("%lf",&a[i]);
sum+=a[i];
}
for(i=0;i<n-1;i++)
for(int j=0;j<n-i-1;j++)
{
if(a[j]<a[j+1]){
double q=a[j];
a[j]=a[j+1];
a[j+1]=q;
}
}
printf("%.2lf ",sum/double(n));
for(i=0;i<n-1;i++)
printf("%.2lf ",a[i]);
printf("%.2lf\n",a[i]);
}
}
return 0;
}
Problem1521
#include<stdio.h>
#include<string.h>
int main()
{
int n;
scanf("%d",&n);
while(n--)
{
char a[100];
scanf("%s",a);
int s=0,j=strlen(a)-1;
for(int i=0;i<strlen(a);i++)
if(a[i]==a[j--])
s++;
if(s==strlen(a))
printf("Y\n");
else printf("N\n");
}
return 0;
}
Problem1523
#include <stdio.h>
int main()
{
int a=0,b=0;
int c=0;
scanf("%d，%d",&a,&b);
c=a;
a=b;
b=c;
printf("a is %d，b is %d",a,b);
return 0;
}
Problem1543
#include <stdio.h>
int main() {
int i,n;
scanf("%d",&n);
for(i=1;i<=n;++i){
int a,b,c;
scanf("%d%d",&a,&b);
if(a==10) scanf("%d",&c);
if(a==8) scanf("%o",&c);
if(a==16) scanf("%X",&c);
if(b==10) printf("%d\n",c);
if(b==8) printf("%o\n",c);
if(b==16) printf("%X\n",c);
}
return 0;}
Problem1544
#include <iostream>
#include <string>
using namespace std;
int main()
{
int i,n;
scanf("%d",&n);
while(n--)
{
int flag=0;
string a;
cin>>a;
int t=a.length()-1;
for(i=0;i<a.length()/2;i++)
{
if(a[i]==a[t])
{
flag=1;
t--;
}
else {flag=0;break;}
}
if(flag==1)cout<<"Y"<<endl;
else cout<<"N"<<endl;
}
return 0;
}
Problem1545
#include <stdio.h>
int main()
{
int i,n;
scanf("%d",&n);
double a[100];
for(i=0;i<n;i++)
{
scanf("%lf",&a[i]);
}
double max=a[0],min=a[0],sum=0.0;
for(i=0;i<n;i++)
{
if(a[i]>max) max=a[i];
if(a[i]<min) min=a[i];
sum+=a[i];
}
printf("%.2lf\n%.2lf\n%.2lf",max,min,sum/n);
return 0;
}
Problem1572
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main()
{
string num;
int n;
cin>>n;
while(n--){
cin>>num;
{
if(num.length()==1&&num[0]=='0') cout<<"0"<<endl;
else{
int flag=0,i,a=0;
if(num[0]=='-') a++;
for(i=num.length()-1;i>=a;i--)
{
if(num[i]!='0'){
flag=1;
break;}
}
if(num[0]=='-') cout<<"-";
if(flag){
for(int k=i;k>=a;k--)
cout<<num[k];
cout<<endl;
}
}
}
}
return 0;
}
Problem1578
#include <stdio.h>
#include <math.h>
int main()
{
int n;
scanf("%d",&n);
while(n--)
{
int x1=0,y1=0,x2=0,y2=0;
scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
if(x1==x2||y1==y2)
{
printf("0\n");
}
else
{
int area=(x1*y2-x2*y1); //關鍵點
if(area<0) area=-area;
printf("%d\n",area);
}
}
return 0;
}
Problem1580
#include <iostream>
using namespace std;
int main()
{
cout << " *" << endl;
cout << " * *" << endl;
cout << " * *" << endl;
cout << " * *" << endl;
cout << " * *" << endl;
cout << " * *" << endl;
cout << " * *" << endl;
cout << "* * *" << endl;
cout << " * *" << endl;
cout << " * *" << endl;
cout << " * *" << endl;
cout << " * *" <<endl;
cout << " * *" <<endl;
cout << " * *" <<endl;
cout << " *" <<endl;
return 0;
}
Problem1581
#include <iostream>
using namespace std;
int main()
{
int n,j,k,q;
cin>>n;
int i,t;
// while(n--)
for(t=0;t<n;t++)
{
int m;
cin>>m;
q=2;
if(m%2!=0){
if(m>49)m=49;
else if(m>=5)m=m;
k=m/2;
for(j=1;j<=k;j++)
{
if(j==1){
for(i=1;i<=m/2+1;i++)
{
if(i==m/2+1)cout<<"*";
else cout<<" ";
}
cout<<endl;}
else{
for(i=1;i<=m/2+j;i++)
{
if(i==m/2+j||i==m/2+j-q) cout<<"*";
else cout<<" ";
}
cout<<endl;
q=q+2;
}
}
for(j=1;j<=m;j++)
{
if(j==1||j==m/2+1||j==m)cout<<"*";
else cout<<" ";
}
cout<<endl;
int p;p=2;
for(j=k;j>=1;j--)
{
if(j==1){
for(i=1;i<=m/2+1;i++)
{
if(i==m/2+1)cout<<"*";
else cout<<" ";
}
cout<<endl;}
else{
for(i=1;i<=m/2+j;i++)
{
if(i==m/2+j||i==p) cout<<"*";
else cout<<" ";
}
cout<<endl;
p=p+1;
}
}
}
}
return 0;
}
Problem1585
#include<stdio.h>
#include<string.h>
int max(int x,int y)
{
if(x>y)
return x;
else
return y;
}
int main()
{
int n;
scanf("%d",&n);
char str1[510],str2[510];
while(n--)
{
scanf("%s %s",str1,str2);
int a[510]={0},b[510]={0},c[510]={0},i;
int m,n,max1=0;
m=strlen(str1); //a的長度
n=strlen(str2); //b的長度
max1=max(m,n); //長度較大的
for(i=0;i<max1;i++)
{
a[m-i-1]=str1[i]-'0';
// printf("%d ",a[m-i-1]);
b[n-i-1]=str2[i]-'0';
// printf("%d\n",b[n-i-1]);
}
for(i=0;i<max1;i++){
c[i]=a[i]+b[i];
// printf("%d ",c[i]);
}
for(i=0;i<max1;i++)
{
c[i+1]=c[i]/10+c[i+1];
c[i]=c[i]%10;
}
if(c[max1]!=0)
{
for(i=max1;i>=0;i--)
printf("%d",c[i]);
}
else
{
for(i=max1-1;i>=0;i--)
printf("%d",c[i]);
}
printf("\n");
}
return 0;
}
Problem1587
#include <iostream>
#include <iomanip>
using namespace std;
int main()
{
double a,b;
int n,m;
cin>>n;
while(n--)
{
cin>>a>>b;
cin>>m;
cout <<setiosflags(ios::fixed);
cout<<setprecision(m)<<a+b<<endl;
}
return 0;
}
Problem1588
#include <stdio.h>
int main()
{
int m;
scanf("%d",&m);
while(m--){
int n;
scanf("%d",&n);
if(n>=3&&n<=1000){
int i,j,a[1000];
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
int b,c,d[1000],t=0;
scanf("%d%d",&b,&c);
for(i=0;i<n;i++)
{
if(i!=(b-1)&&i!=(c-1))
d[t++]=a[i];
}
for(i=0;i<t;i++)
{
for(j=0;j<t-i-1;j++)
{
if(d[j]>d[j+1])
{
int q=d[j];
d[j]=d[j+1];
d[j+1]=q;
}
}
}
for(i=0;i<t-1;i++)
printf("%d ",d[i]);
printf("%d\n",d[i]);
}
}
return 0;
}
Problem1589
#include <stdio.h>
#include <string.h>
long long a,b;
char s1[20],s2[20];
int len1,len2;
int main()
{
int i;
while(~scanf("%s%s",s1,s2))
{
len1 = strlen(s1);
len2 = strlen(s2);
a = b = 0;
for(i = 0; i<len1;i++)
{
if(s1[i]>='0' && s1[i]<='9')
{
a = a*10+s1[i]-'0';
}
}
if(s1[0] == '-')
a = -a;
for(i=0;i<len2;i++)
{
if(s2[i]>='0' && s2[i]<='9')
b = b*10+s2[i]-'0';
}
if(s2[0] == '-')
b = -b;//求和後的正負
printf("%lld\n",a+b);
}
return 0;
}