返回上一頁

121319陳兆翔(2009-03-05 16:50:27)

#include<iostream> using namespace std; int main(){ string stri; while (cin>>stri){ cout << "Hello "<< stri << endl; } return 0; }

121319陳兆翔(2009-03-05 16:52:10)

#include<iostream> using namespace std; main(){ int d1,d2; while (cin>>d1>>d2){ cout << d1+d2 << endl; } return 0; }

121319陳兆翔(2009-03-05 16:52:50)

#include<iostream> using namespace std; main(){ int M;//月 int D;//日 int S;//(M*2+D)%3 while(cin>>M>>D){ S=(M*2+D)%3; if (S==0) cout<<"普通"<< endl; if (S==1) cout<<"吉"<< endl; if (S==2) cout<<"大吉"<< endl; } return 0; }

121319陳兆翔(2009-03-05 16:53:16)

#include<iostream> using namespace std; main(){ int Y; while(cin>>Y){ if ((Y%4==0)&&(Y%100!=0)||(Y%400==0)) cout<<"閏年"<<endl; else cout<<"平年"<<endl; } return 0; }

121319陳兆翔(2009-03-05 16:53:45)

#include<iostream> using namespace std; main(){ int now,n[5],test,i,j,test1,test2; cin>>now; for (j=1;j<=now;j++){ for (i=0;i<=3;i++){ cin>>n[i]; } test1=1; if ((n[1]-n[0])!=(n[2]-n[1]) || (n[1]-n[0])!=(n[3]-n[2])){ test1=0; } if (test1==1){ for (i=0;i<=3;i++){ cout<<n[i]<<" "; } cout<<n[3]*2-n[2]<<endl; } test2=1; if ((n[1]/n[0])!=(n[2]/n[1]) || (n[1]/n[0])!=(n[3]/n[2])){ test2=0; } if (test2==1&&test1!=1){ for (i=0;i<=3;i++){ cout<<n[i]<<" "; } cout<<n[3]*n[3]/n[2]<<endl; } } return 0; }

121319陳兆翔(2009-03-05 16:54:02)

#include<iostream> #include<math.h> using namespace std; main(){ int a,b,c; double D; double x1,x2; double temp; while (cin>>a>>b>>c){ D=(b*b)-(4*a*c); if (D<0){ cout<<"No real root"<<endl; } if (D==0){ cout<<"Two same roots x="<<(-b/(2*a))<<endl; } if (D>0){ x1=(-b+sqrt(D))/(2*a); x2=(-b-sqrt(D))/(2*a); if (x1<x2){ temp=x1; x1=x2; x2=temp; } cout<<"Two different roots x1="<<x1<<" , x2="<<x2<<endl; } } return 0; }

121319陳兆翔(2009-03-05 16:54:27)

#include<iostream> //#include<math.h> using namespace std; main(){ long flag,num,i; while (cin>>num){ flag=0; for (i=2;i*i<=num&&i<=46340;i++){ if (num%i==0){ flag=1; break; } } if (flag==0) cout<<"質數"<<endl; else cout<<"非質數"<<endl; } return 0; }

121319陳兆翔(2009-03-05 16:54:51)

#include <iostream> using namespace std; int math[10]; int num (int n){ if (n==1) cout<<"壹"; if (n==2) cout<<"貳"; if (n==3) cout<<"參"; if (n==4) cout<<"肆"; if (n==5) cout<<"伍"; if (n==6) cout<<"陸"; if (n==7) cout<<"柒"; if (n==8) cout<<"捌"; if (n==9) cout<<"玖"; } int math_che(int k){ int i; int j; for (i=9;i>=k;i--){ if (math[i]==1){ cout<<"零"; for(j=9;j>=k;j--){ math[j]=0; } break; } } } main(){ long int text; int check; int math_8=0; int math_4=0; int mark=0; int j; while(cin>>text){ for(j=9;j>=0;j--){ math[j]=0; } if (text/1000000000!=0){ num(text/1000000000); cout<<"拾"; math_8=1; mark=1; math[9]=1; } if ((text%1000000000)/100000000!=0){ num((text%1000000000)/100000000); math_8=1; mark=1; math[8]=1; } if (math_8==1) { cout<<"億"; } if ((text%100000000)/10000000!=0){ num((text%100000000)/10000000); cout<<"仟"; math_4=1; mark=1; math[7]=1; } if ((text%10000000)/1000000!=0){ if (mark==1 && math[7]!=1) math_che(8); num((text%10000000)/1000000); cout<<"佰"; math_4=1; mark=1; math[6]=1; } if ((text%1000000)/100000!=0){ if (mark==1 && math[6]!=1) math_che(7); num((text%1000000)/100000); cout<<"拾"; math_4=1; mark=1; math[5]=1; } if ((text%100000)/10000!=0){ if (mark==1 && math[5]!=1) math_che(6); num((text%100000)/10000); math_4=1; mark=1; math[4]=1; } if (math_4==1) { cout<<"萬"; } if ((text%10000)/1000!=0){ num((text%10000)/1000); cout<<"仟"; mark=1; math[3]=1; } if ((text%1000)/100!=0){ if (mark==1 && math[3]!=1) math_che(4); num((text%1000)/100); cout<<"佰"; mark=1; math[2]=1; } if ((text%100)/10!=0){ if (mark==1 && math[2]!=1) math_che(3); num((text%100)/10); cout<<"拾"; mark=1; math[1]=1; } if (text%10!=0){ if (mark==1 && math[1]!=1) math_che(2); num(text%10); mark=1; math[0]=1; } if (mark==1){ cout<<endl; } else{ cout<<"零"; cout<<endl; } math_8=0; math_4=0; mark=0; } }

121319陳兆翔(2009-03-05 16:55:11)

#include<iostream> using namespace std; main(){ char turn; while(cin.get(turn)){ if (turn!=10) turn=turn-7; printf("%c",char(turn)); } }

121319陳兆翔(2009-03-05 16:55:24)

#include<iostream> using namespace std; void swap(long &n1,long &n2){ int temp; temp=n1; n1=n2; n2=temp; } main(){ int n1,n2; while(cin>>n1){ cin>>n2; if (n1<n2) swap(n1,n2); while(n1!=0){ if (n1<n2) swap(n1,n2); n1=n1%n2; if (n1==n2) break; } cout<<n2<<endl; } }

121319陳兆翔(2009-05-21 16:52:20)

#include<iostream> #include<math.h> using namespace std; int main(){ int num1,num2,i,j,x1,x2,y1,y2,s,min; float min_num,now; cin>>num1; for (i=1;i<=num1;i++) { min=0; min_num=1000000; cin>>num2; for (j=1;j<=num2;j++) { cin>>x1>>y1>>x2>>y2>>s; now=sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2))*s/(x1-x2); if (now<0) now=-1*now; if (now<min_num){ min_num=now; min=j; } } cout<<min<<endl; } }

121319陳兆翔(2009-10-15 15:24:30)

#include<iostream> using namespace std; int main(){ int n,m; int i,j,k; int temp; int num[1000]; int max; int count; cin>>n; for (i=0;i<n;i++){ cin>>m; max=0; count=0; for (j=0;j<m;j++) cin>>num[j]; for (j=0;j<m;j++){ for (k=j;k<m;k++){ if (num[j]>num[k]){ temp=num[k]; num[k]=num[j]; num[j]=temp; } } } max=num[k/2]; for (j=0;j<m;j++){ if (num[j]>max) count=count-max+num[j]; else count=count-num[j]+max; } cout<<count<<endl; } }

121319陳兆翔(2009-10-22 16:15:13)

#include<iostream> using namespace std; char A[1001]; char B[1001]; bool used[1001]; long long int A_L=0; long long int B_L=0; int main(){ int a; int i; int j; scanf("%d",&a); scanf("%*c"); while(a--){ A_L=0; B_L=0; i=0; scanf("%c",&A[i]); while(('a'<=A[i]&&A[i]<='z' )||('A'<=A[i]&&A[i]<='Z' )||('0'<=A[i]&&A[i]<='9')||(A[i]==' ')||(A[i]==',')||(A[i]=='.')){ A_L++; used[i]=0; i++; scanf("%c",&A[i]); } i=0; scanf("%c",&B[i]); while(('a'<=B[i]&&B[i]<='z' )||('A'<=B[i]&&B[i]<='Z' )||('0'<=B[i]&&B[i]<='9')||B[i]==' '||B[i]==','||B[i]=='.'){ B_L++; i++; scanf("%c",&B[i]); } if (A_L==B_L){ for (i=0;i<A_L;i++){ for (j=0;j<A_L;j++){ if (A[i]==B[j] && used[j]==0){ used[j]=1; break; } } } for (i=0;i<A_L;i++) if (used[i]!=1) break; if (i==A_L) printf("possible\n"); else printf("impossible\n"); } } }

121319陳兆翔(2009-10-22 16:29:37)

#include<stdio.h> #include<stdlib.h> int main(){ long long F[1000]; int n; int max=2; int i; scanf("%d",&n); while(n!=-1){ F[0]=0; F[1]=1; for (i=max;i<=n;i++){ F[i]=F[i-2]+F[i-1]+1; max++; } printf("%lld %lld \n",F[n],F[n]+F[n-1]+1); scanf("%d",&n); } return 0; }

121319陳兆翔(2009-10-29 15:40:56)

O(n^2)

#include<iostream> using namespace std; bool sum[1000]; int n;int i;int j;int num[21];int now;int ma; int main(){ while(cin>>n){ if (n!=0){ now=0; ma=0; for (i=0;i<n;i++) { cin>>num[i]; ma=ma+num[i]; } if (ma!=i){ for (i=0;i<ma;i++) sum[i]=0; for (i=0;i<n;i++){ now=0; for (j=i;j<n;j++){ now=now+num[j]; sum[now]=1; } } for (i=1;i<ma;i++) if (sum[i]==0) break; if (i==ma) cout<<"YES\n"; else cout<<"NO\n"; } else cout<<"NO\n"; } else return 0; } }

121319陳兆翔(2009-10-29 15:41:23)

GCD 加 紀錄

#include<iostream> using namespace std; void swap(int &i,int &j){ int temp; temp=i; i=j; j=temp; } int GCD(int i,int j){ if (i>j) swap(i,j); while(j!=0 && i!=0){ j=j%i; swap(i,j); } return j; } int main(){ int sum[502]={0}; int N=501,G=0; int i,j; while(cin>>N){ G=0; if (N!=0){ if (sum[N]==0){ for(i=1;i<N;i++){ for(j=i+1;j<=N;j++) { G+=GCD(i,j); } } sum[N]=G; cout<<sum[N]<<endl; } else cout<<sum[N]<<endl; } else return 0; } }

121319陳兆翔(2009-11-05 15:21:58)

#include<iostream> using namespace std; int main(){ string s; bool test[10]; int i,j; for (i=0;i<9;i++) { for (j=1;j<10;j++) test[j]=0; cin>>s; for (j=0;j<10;j++) test[s[j]-'0']=1; for (j=0;j<10;j++) if (test[j]==0)printf("%d\n",j); } return 0; }

121319陳兆翔(2009-11-12 15:03:51)

#include<stdio.h> int A[101][101]={0}; int B[101][101]={0}; int T; int main(){ int a,b,c,d; int i,j,k; while(scanf("%d%d%d%d",&a,&b,&c,&d)!=EOF){ if (b!=c) printf("Error\n"); else{ for (i=0;i<a;i++) for (j=0;j<b;j++) scanf("%d",&A[i][j]); for (i=0;i<c;i++) for (j=0;j<d;j++) scanf("%d",&B[i][j]); for (i=0;i<a;i++){ for (j=0;j<d;j++){ T=0; for(k=0;k<b;k++) T+=A[i][k]*B[k][j]; printf("%d ",T); } printf("\n"); } } } return 0; }