返回上一頁

juinching林俊卿(2009-06-19 01:13:34)

最後一筆測資asd...asd答案為2

#include<iostream> using namespace std; int main() { string s; while(getline(cin, s)){ int c=0; int a=0; for (int i=0;i<s.length();i++) { if (isalpha(s[i])) a++; else { if (a>0) c++; a=0; } } if (a>0) c++; cout<<c<<endl; } return 0; }

juinching林俊卿(2009-06-19 10:37:41)

#include<iostream> using namespace std; int main() { long s; while(cin>>s){ int i=2; int c=0; int h=s/2; int t=0; while (1) { if (s % i==0) { t=i; c++; s/=i; } else { if (t!=0) { cout<<t; if (c>1) cout<<"^"<<c; if (s!=1) cout<<" * "; if (i>h || s==1) break; c=0; t=0; } i++; } } cout<<endl; } return 0; }

juinching林俊卿(2009-06-19 21:33:00)

#include<iostream> using namespace std; int main() { int a[9][9]; while(!cin.eof()){ int i,j; for (i=0;i<9;i++) for (j=0;j<9;j++) cin>>a[i][j]; if (a[0][0]==0) break; int s; int t=1; for (i=0;i<9;i++) { s=0; for (j=0;j<9;j++) s=s+a[i][j]; if (s!=45) t=0; } for (i=0;i<9;i++) { s=0; for (j=0;j<9;j++) s=s+a[j][i]; if (s!=45) t=0; } int k; for (k=0;k<3;k++) { s=0; for (i=0;i<3;i++) for (j=0+k*3;j<3+k*3;j++) s=s+a[i][j]; if (s!=45) t=0; s=0; for (i=3;i<6;i++) for (j=0+k*3;j<3+k*3;j++) s=s+a[i][j]; if (s!=45) t=0; s=0; for (i=6;i<9;i++) for (j=0+k*3;j<3+k*3;j++) s=s+a[i][j]; if (s!=45) t=0; } if (t==0) cout<<"no"; else cout<<"yes"; cout<<endl; for (i=0;i<9;i++) for (j=0;j<9;j++) a[i][j]=0; } return 0; }

juinching林俊卿(2009-06-22 16:31:51)

#include<iostream> #include <map> using namespace std; void replace(string& modifyMe,string findMe, string newChars){ // Look in modifyMe for the "find string" // starting at position 0 int i = modifyMe.find(findMe, 0); // Did we find the string to replace? if(i != string::npos) // Replace the find string with newChars modifyMe.replace(i,newChars.size(),newChars); } int main() { map<char,int> mymap; map<char,int>::iterator it; mymap['M']=1000; mymap['D']=500; mymap['C']=100; mymap['L']=50; mymap['X']=10; mymap['V']=5; mymap['I']=1; char s[7]={'M','D','C','L','X','V','I'}; string x,y; int xi,yi; string ax; int d; while(cin >> x){ if (x=="#") break; cin>>y; //cout<<x<<" "<<y<<endl; int i; xi=0; for (i=0;i<x.length();i++) { if (mymap.find(x[i])->second>=mymap.find(x[i+1])->second || i==x.length()-1) xi+=mymap.find(x[i])->second; else xi-=mymap.find(x[i])->second; } yi=0; for (i=0;i<y.length();i++) { if (mymap.find(y[i])->second>=mymap.find(y[i+1])->second || i==y.length()-1) yi+=mymap.find(y[i])->second; else yi-=mymap.find(y[i])->second; } d=abs(xi-yi); //cout<<x<<" "<<xi<< " "<<y<<" " <<yi<< " " <<d<<endl; if (d==0) { cout<<"ZERO"<<endl; continue; } i=0; ax=""; while (1) { if (d>=mymap.find(s[i])->second) { //cout<<d<<" " <<ax<<endl; d-=mymap.find(s[i])->second; ax=ax+mymap.find(s[i])->first; } else i++; if (i>6) break; } replace(ax,"VIIII","IX "); replace(ax,"LXXXX","XC "); replace(ax,"DCCCC","CM "); replace(ax,"IIII","IV "); replace(ax,"XXXX","XL "); replace(ax,"CCCC","CD "); for (i=0;i<ax.length();i++) if (ax[i]!=' ') cout<<ax[i]; cout<<endl; } return 0; }

juinching林俊卿(2009-10-22 16:03:02)

/* gets example */ #include <iostream> #include <algorithm> #include <vector> #include <string> using namespace std; int main() { int i; int j; char a[1001],b[1001]; int t; gets(a); t=atoi(a); for (i=0;i<t;i++) { gets(a); gets(b); sort(a,a+strlen(a)); sort(b,b+strlen(b)); if (strcmp(a,b)==0) printf("possible\n"); else printf("impossible\n"); } return 0; }