makeover: (個人形象的)改頭換面
take over: 接管
follow my lead: 跟著我
poise: 姿態(不確定歌詞裡的意思)
flounce: (為了吸引人注意)大步走動
fix my hair: 整理頭髮
cohort: 有共通點的(通常指年齡)一群人
awfully:非常、十分
dialysis: (醫學上對患者的)透析
pal: 朋友
dreary: 沉悶的、令人沮喪的
unprepossessing: 無趣乏味的
on their own behalf: 他們自己的行為上
shrewd: 精明的
clandestinely: 暗中的
歌詞的兩段類比好美！
Like a comet pulled from orbit
As it passes the sun
Like a stream that meets a boulder
Halfway through the wood
Like a ship blown from its mooring
By a wind off the sea
Like a seed dropped by a sky bird
In a distant wood
for good: 玩了雙關，for good(=better)，也是永遠
it's up to you: 靠你自己
boulder: 巨石；卵石
part: 分別；離開
handprint: 手印
mooring: 停泊處
clear the air: 消除隔閡
超級推Willemijn Verkaik唱的版本，太好聽了！！！
https://soundcloud.com/nikolay-hsu/defying-gravity/s-UnSwZ
fly off the handle: 發火
grovel: 卑躬屈膝
second-guess: 猜測、預言
grandeur: 宏偉壯麗
in tandem: 同心協力
renown: 名聲
infix to postfix
#include <iostream>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
bool isOperator(char c)
{
if (c == '+' || c == '/' || c == '-' || c == '*') return true;
return false;
}
int priority(char c)
{
if (c == '+' || c == '-') return 1;
if (c == '*' || c == '/') return 2;
}
string to_postfix(string s)
{
string postfix = "";
stack<char> st;
s += ")";
st.push('(');
for (int i = 0; i < s.size(); i++)
{
if (s[i] == '(') st.push(s[i]);
else if (isOperator(s[i]))
{
while (st.top()!='('&&priority(st.top()) >= priority(s[i]))
{
postfix += st.top();
st.pop();
}
st.push(s[i]);
}
else if (s[i] == ')')
{
while (st.top() != '(')
{
postfix += st.top();
st.pop();
}
st.pop();
}
else
{
postfix += s[i];
}
}
while (!st.empty())
{
postfix += st.top();
st.pop();
}
return postfix;
}
string to_prefix(string s)
{
reverse(s.begin(), s.end());
for (int i = 0; i < s.size(); i++)
{
if (s[i] == '(') s[i] = ')';
else if (s[i] == ')') s[i] = '(';
}
s = to_postfix(s);
reverse(s.begin(), s.end());
return s;
}
int main()
{
string s;
getline(cin, s);
string postfix = to_postfix(s);
cout << postfix << endl;
cout << to_prefix(s);
return 0;
}
解題心得:
會錯的可能有兩個地方:
1.如果全都不是字母，輸出yes
2.如果字母都是偶數，也輸出yes (奇數次<=1都可算對)
程式碼:
#include <iostream>
#include <map>
using namespace std;
int main()
{
string s;
while(cin>>s)
{
map<char,int> mp;
map<char,int>::iterator it;
int odd_count=0;
for(int i=0;i<s.size();i++)
{
if(isalpha(s[i]))
{
s[i]=tolower(s[i]);
mp[s[i]]++;
}
}
for(it=mp.begin();it!=mp.end();it++)
{
if(it->second%2) odd_count++;
}
if(odd_count>1) cout<<"no..."<<endl;
else cout<<"yes !"<<endl;
}
return 0;
}
#include <iostream>
#include <sstream>
using namespace std;
int main()
{
int count=0;
string s,word,tmp;
getline(cin,word);
getline(cin,s);
for(int i=0;i<word.size();i++)
word[i]=tolower(word[i]);
for(int i=0;i<s.size();i++){
s[i]=tolower(s[i]);
}
stringstream ss(s);
while(ss>>tmp)
{
if(tmp==word)
count++;
}
word=' '+word+' ';
s=' '+s+' ';
if(s.find(word)!=string::npos) cout<<count<<" "<<s.find(word)<<endl;
else cout<<-1<<endl;
return 0;
}
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int t,n,temp;
cin>>t;
for(int r=1;r<=t;r++)
{
cout<<"Case #"<<r<<":"<<endl;
vector<int> v[3],vn[3];
vector<int>::iterator it1,it2;
for(int i=0;i<3;i++)
{
cin>>n;
for(int j=0;j<n;j++)
{
cin>>temp;
v[i].push_back(temp);
}
}
int record[3]={0};
for(int i=0;i<v[0].size();i++)
{
it1=find(v[1].begin(),v[1].end(),v[0][i]);
it2=find(v[2].begin(),v[2].end(),v[0][i]);
if(it1==v[1].end()&&it2==v[2].end()) vn[0].push_back(v[0][i]),record[0]++;
}
for(int i=0;i<v[1].size();i++)
{
it1=find(v[0].begin(),v[0].end(),v[1][i]);
it2=find(v[2].begin(),v[2].end(),v[1][i]);
if(it1==v[0].end()&&it2==v[2].end()) vn[1].push_back(v[1][i]),record[1]++;
}
for(int i=0;i<v[2].size();i++)
{
it1=find(v[0].begin(),v[0].end(),v[2][i]);
it2=find(v[1].begin(),v[1].end(),v[2][i]);
if(it1==v[0].end()&&it2==v[1].end()) vn[2].push_back(v[2][i]),record[2]++;
}
int Max=max(record[0],record[1]);
Max=max(Max,record[2]);
for(int i=0;i<3;i++)
{
if(Max==record[i])
{
sort(vn[i].begin(),vn[i].end());
cout<<i+1<<" "<<record[i];
for(int j=0;j<vn[i].size();j++)
cout<<" "<<vn[i][j];
cout<<endl;
}
}
}
return 0;
}
#include <iostream>
using namespace std;
int main()
{
string s;
while(getline(cin,s))
{
if(s!="___________")
{
int value=0;
for(int i=0;i<s.size();i++)
{
if(s[i]=='o') value=value*2+1;
else if(s[i]==' ') value*=2;
}
cout<<char(value);
}
}
return 0;
}
#include <iostream>
#include <map>
using namespace std;
bool isPrime(int n)
{
if(n==1) return false;
for(int i=2;i<=n/2;i++)
if(n%i==0) return false;
return true;
}
int main()
{
string s;
int t;
cin>>t;
for(int i=1;i<=t;i++)
{
int empty=1;
cin>>s;
cout<<"Case "<<i<<": ";
map<char,int> mp;
map<char,int>::iterator it;
for(int j=0;j<s.size();j++)
mp[s[j]]++;
for(it=mp.begin();it!=mp.end();it++)
{
if(isPrime(it->second))
{
cout<<it->first;
empty=0;
}
}
if(empty) cout<<"empty";
cout<<endl;
}
return 0;
}
#include <iostream>
#include <map>
#include <iomanip>
using namespace std;
int main()
{
int n;
string s;
cin>>n;
getchar();
getchar();
while(n--)
{
map<string,int> mp;
map<string,int>::iterator it;
int total=0;
while(getline(cin,s)&&s!="")
{
mp[s]++;
total++;
}
for(it=mp.begin();it!=mp.end();it++)
{
cout<<it->first<<" "<<fixed<<setprecision(4)<<(double)it->second/total*100<<endl;
}
if(n!=0)
cout<<endl;
}
return 0;
}
#include <iostream>
#include <cmath>
using namespace std;
struct Point
{
int x,y;
};
double distance(Point a,Point b)
{
return sqrt(pow(a.x-b.x,2)+pow(a.y-b.y,2));
}
int main()
{
int n,m,a,b;
cin>>n>>m;
Point p[1001],ask;
for(int i=0;i<n;i++)
cin>>p[i].x>>p[i].y;
while(m--)
{
cin>>ask.x>>ask.y;
double dist=distance(p[0],ask);
int flag=0;
for(int i=0;i<n;i++)
{
if(dist>distance(p[i],ask))
{
flag=i;
dist=distance(p[i],ask);
}
}
cout<<flag+1<<endl;
}
}
#include <iostream>
using namespace std;
int main()
{
string s,ss;
int command;
while(cin>>s)
{
ss=s;
for(int i=0;i<s.size();i++)
{
cin>>command;
ss[command-1]=s[i];
}
cout<<ss<<endl;
}
}
#include <iostream>
#include <algorithm>
#include <map>
using namespace std;
int main()
{
int n,arr[100001];
map<int,int> m;
map<int,int>::reverse_iterator it;
cin>>n;
for(int i=0;i<n;i++)
cin>>arr[i];
for(int i=0;i<n;i++)
m[arr[i]]++;
sort(arr,arr+n);
for(int i=0;i<n;i++)
cout<<arr[i]<<" ";
cout<<endl;
for(it=m.rbegin();it!=m.rend();it++)
cout<<it->first<<" ";
}
#include <iostream>
#include <algorithm>
using namespace std;
bool cmp(string a,string b)
{
return (a+b)>(b+a);
}
int main()
{
int n;
while(cin>>n)
{
if(n==0) break;
string l[51];
for(int i=0;i<n;i++)
cin>>l[i];
sort(l,l+n,cmp);
for(int i=0;i<n;i++)
cout<<l[i];
cout<<endl;
}
return 0;
}
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int n,m,tmp;
while(cin>>n>>m)
{
vector<vector<int>> l;
for(int i=0;i<n;i++)
{
vector<int> ll;
for(int j=0;j<m;j++)
{
cin>>tmp;
ll.push_back(tmp);
}
l.push_back(ll);
}
sort(l.begin(),l.end());
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
cout<<l[i][j]<<" ";
cout<<'\n';
}
}
return 0;
}
#include <iostream>
#include <map>
#include <algorithm>
using namespace std;
int main()
{
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int n,tmp,index[5];
while(cin>>n)
{
if(n==0) break;
map<string,int> m;
map<string,int>::iterator it;
while(n--)
{
string temp;
for(int i=0;i<5;i++)
cin>>index[i];
sort(index,index+5);
for(int i=0;i<5;i++)
temp+=to_string(index[i]);
it=m.find(temp);
if(it!=m.end()) (it->second)++;
else m[temp]=1;
}
int max=0,ans=0;
for(it=m.begin();it!=m.end();it++)
if(it->second>max) max=it->second;
for(it=m.begin();it!=m.end();it++)
if(it->second==max) ans+=max;
cout<<ans<<'\n';
}
return 0;
}
#include <iostream>
#include <map>
using namespace std;
int main()
{
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int n;
string temp;
while(cin>>n)
{
int len=1;
map<string,int> m;
map<string,int>::iterator it;
while(n--)
{
cin>>temp;
it=m.find(temp);
if(it!=m.end())
cout<<"Old! "<<it->second<<'\n';
else
{
cout<<"New! "<<len<<'\n';
m[temp]=len++;
}
}
}
return 0;
}
#include <iostream>
using namespace std;
int main()
{
int a,b,c,d;
while(cin>>a>>b>>c>>d)
{
int ans=0,space=0;
ans+=d;
ans+=c;
space+=37*c;
ans+=(b%8==0?b/8:b/8+1);
space+=64-8*(b%8);
if(a>space) ans++;
cout<<ans<<endl;
}
return 0;
}
#include <iostream>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
cout<<(5*n+1)+(m-1)*(3*n+1)<<endl;
return 0;
}
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
string command,x,n;
vector<string> l;
while(cin>>command)
{
if(command=="SHOW") break;
if(command=="ADD")
{
cin>>x;
l.push_back(x);
}
else if(command=="INSERT")
{
cin>>x>>n;
vector<string>::iterator it=find(l.begin(),l.end(),n);
l.insert(it,x);
}
else if(command=="REMOVE")
{
cin>>x;
for(int i=0;i<l.size();i++)
{
if(l[i]==x)
{
l.erase(l.begin()+i);
break;
}
}
}
}
for(int i=0;i<l.size();i++)
cout<<l[i]<<" ";
return 0;
}
#include <iostream>
using namespace std;
int main()
{
string name,command;
int width,height;
char picture[37][25];
while(cin>>name>>width>>height>>command)
{
for(int i=0;i<height;i++)
for(int j=0;j<width;j++)
cin>>picture[i][j];
cout<<name<<endl;
for(int l=0;l<command.size();l++)
{
char copy[37][25];
for(int i=0;i<height;i++)
for(int j=0;j<width;j++)
copy[i][j]=picture[i][j];
if(command[l]=='R')
{
for(int i=0;i<height;i++)
for(int j=0;j<width;j++)
picture[i][j]=copy[i][width-1-j];
}
else
{
for(int i=0;i<height;i++)
for(int j=0;j<width;j++)
picture[i][j]=copy[height-1-i][j];
}
}
for(int i=0;i<height;i++)
{
for(int j=0;j<width;j++)
cout<<picture[i][j];
cout<<endl;
}
}
return 0;
}
#include <iostream>
using namespace std;
int main()
{
int t,n,m;
cin>>t;
while(t--)
{
cin>>n>>m;
long long int up=m-1,down=m-n;
cout<<(up+down)*n/2<<endl;
}
return 0;
}
#include <iostream>
using namespace std;
int main()
{
int k,n,m,x,y;
while(cin>>k)
{
if(k==0) break;
cin>>n>>m;
for(int i=0;i<k;i++)
{
cin>>x>>y;
if(x==n||y==m) cout<<"divisa"<<endl;
else if(x>n&&y>m) cout<<"NE"<<endl;
else if(x>n&&y<m) cout<<"SE"<<endl;
else if(x<n&&y>m) cout<<"NO"<<endl;
else cout<<"SO"<<endl;
}
}
return 0;
}
#include <iostream>
#include <vector>
using namespace std;
int main()
{
string s;
while(cin>>s)
{
if(s=="0") break;
cout<<"Original number was "<<s<<endl;
string bigToSmall=s,smallToBig=s;
int chain=0;
vector<string> list;
while(1)
{
chain++;
bigToSmall=s,smallToBig=s;
for(int i=0;i<bigToSmall.size();i++)
{
for(int j=0;j<bigToSmall.size();j++)
{
if(bigToSmall[i]>bigToSmall[j]) swap(bigToSmall[i],bigToSmall[j]);
if(smallToBig[i]<smallToBig[j]) swap(smallToBig[i],smallToBig[j]);
}
}
int big=stoi(bigToSmall),small=stoi(smallToBig),repeat=0;
s=to_string(big-small);
cout<<big<<" - "<<small<<" = "<<s<<endl;
for(int i=0;i<list.size();i++)
{
if(s==list[i])
{
repeat=1;
break;
}
}
if(repeat) break;
list.push_back(s);
}
cout<<"Chain length "<<chain<<endl<<endl;
}
return 0;
}
#include <iostream>
#include <string>
using namespace std;
int main()
{
string s;
while(getline(cin,s))
{
int sum=0,temp,max=1;
for(int i=0;i<s.size();i++)
{
if('0'<=s[i]&&s[i]<='9') temp=s[i]-'0';
else if('A'<=s[i]&&s[i]<='Z') temp=s[i]-'A'+10;
else if('a'<=s[i]&&s[i]<='z') temp=s[i]-'a'+36;
else continue;
if(temp>max) max=temp;
sum+=temp;
}
for(int i=max;i<=62;i++)
{
if(sum%i==0)
{
cout<<(i+1)<<endl;
break;
}
else if(i==62) cout<<"such number is impossible!"<<endl;
}
}
return 0;
}
#include <iostream>
using namespace std;
int main()
{
int cases,index[12]={31,28,31,30,31,30,31,31,30,31,30,31};
string week[7]={"Saturday","Sunday","Monday","Tuesday","Wednesday","Thursday","Friday"};
cin>>cases;
while(cases--)
{
int m,d,total=0;
cin>>m>>d;
for(int i=0;i<m-1;i++)
total+=index[i];
total+=d;
cout<<week[(total-1)%7]<<endl;
}
}
#include <iostream>
using namespace std;
int main()
{
char ignore;
int t;
cin>>t;
for(int rounds=1;rounds<=t;rounds++)
{
cout<<"Test #"<<rounds<<": ";
int n,flag=0;
long long int matrix[101][101];
cin>>ignore>>ignore>>n;
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
cin>>matrix[i][j];
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
if(matrix[i][j]!=matrix[n-1-i][n-1-j]||matrix[i][j]<0)
flag=1;
}
}
if(flag) cout<<"Non-symmetric."<<endl;
else cout<<"Symmetric."<<endl;
}
}
#include <iostream>
#include <algorithm>
using namespace std;
int n,m;
bool cmp(int a,int b)
{
if(a%m!=b%m) return a%m<b%m;
if(abs(a%2)==1&&abs(b%2)==1) return a>b;
if(abs(a%2)==0&&abs(b%2)==0) return a<b;
return abs(a%2);
}
int main()
{
int l[10001];
while(cin>>n>>m)
{
cout<<n<<" "<<m<<endl;
if(n==0&&m==0) break;
for(int i=0;i<n;i++)
cin>>l[i];
sort(l,l+n,cmp);
for(int i=0;i<n;i++)
cout<<l[i]<<endl;
}
return 0;
}
#include <iostream>
using namespace std;
double f()
{
return 8.7;
}
int main()
{
double (*pF)();
pF=f; // or pF=&f
double result=(*pF)();
cout<<result<<endl;
return 0;
}
#include <iostream>
using namespace std;
int main()
{
int w,h,x,y,map[51][51]={0};
char direction;
cin>>w>>h;
while(cin>>x>>y>>direction)
{
int lost=0;
string command;
cin>>command;
for(int i=0;i<command.size();i++)
{
if(command[i]=='L')
{
switch(direction)
{
case 'N':
direction='W';break;
case 'E':
direction='N';break;
case 'S':
direction='E';break;
case 'W':
direction='S';break;
}
}
else if(command[i]=='R')
{
switch(direction)
{
case 'N':
direction='E';break;
case 'E':
direction='S';break;
case 'S':
direction='W';break;
case 'W':
direction='N';break;
}
}
else if(command[i]=='F')
{
int nextX=x,nextY=y;
if(direction=='N') nextY++;
else if(direction=='E') nextX++;
else if(direction=='S') nextY--;
else if(direction=='W') nextX--;
if(nextX>w||nextX<0||nextY>h||nextY<0)
{
if(map[x][y]==1)
continue;
else
{
lost=1;
map[x][y]=1;
break;
}
}
x=nextX,y=nextY;
}
}
cout<<x<<" "<<y<<" "<<direction<<(lost?" LOST":"")<<endl;
}
return 0;
}
#include <iostream>
using namespace std;
int main()
{
int n;
cin>>n;
while(n--)
{
int l,train[51],times=0;
cin>>l;
for(int i=0;i<l;i++)
cin>>train[i];
for(int i=0;i<l;i++)
{
for(int j=i;j<l;j++)
{
if(train[i]>train[j])
{
swap(train[i],train[j]);
times++;
}
}
}
cout<<"Optimal train swapping takes "<<times<<" swaps."<<endl;
}
return 0;
}
#include <iostream>
using namespace std;
int main()
{
int num;
while(cin>>num)
{
if(num==0) break;
int top=1,n=2,w=3,bottom=7-top,s=7-n,e=7-w;
while(num--)
{
string str;
cin>>str;
if(str=="north")
{
int temp=n;
n=top;
top=s;
s=bottom;
bottom=temp;
}
else if(str=="south")
{
int temp=s;
s=top;
top=n;
n=bottom;
bottom=temp;
}
else if(str=="east")
{
int temp=e;
e=top;
top=w;
w=bottom;
bottom=temp;
}
else if(str=="west")
{
int temp=w;
w=top;
top=e;
e=bottom;
bottom=temp;
}
}
cout<<top<<endl;
}
return 0;
}
#include <iostream>
#include <string>
using namespace std;
int to_dec(string s)
{
int expo=1,sum=0;
for(int i=s.size()-1;i>=0;i--)
{
sum+=(s[i]-'0')*expo;
expo*=2;
}
return sum;
}
int gcd(int a,int b)
{
while((a%=b)!=0&&(b%=a)!=0);
return a+b;
}
int main()
{
int n;
cin>>n;
for(int cases=1;cases<=n;cases++)
{
string s1,s2;
int n1,n2;
cin>>s1>>s2;
n1=to_dec(s1),n2=to_dec(s2);
cout<<"Pair #"<<cases<<": ";
if(gcd(n1,n2)!=1) cout<<"All you need is love!"<<endl;
else cout<<"Love is not all you need!"<<endl;
}
return 0;
}
#include <iostream>
#include <string>
using namespace std;
int main()
{
int cases;
while(cin>>cases)
{
for(int rounds=1;rounds<=cases;rounds++)
{
cout<<"Case "<<rounds<<":"<<endl;
int index[36];
for(int i=0;i<36;i++)
cin>>index[i];
int num;
cin>>num;
while(num--)
{
int n,min_cost=1000000000,min_base=100;
cin>>n;
cout<<"Cheapest base(s) for number "<<n<<":";
for(int i=2;i<=36;i++)
{
int cost=0,number=n;
while(number>0)
{
cost+=index[number%i];
number/=i;
}
if(cost<min_cost) min_cost=cost,min_base=i;
}
for(int i=2;i<=36;i++)
{
int cost=0,number=n;
while(number>0)
{
cost+=index[number%i];
number/=i;
}
if(cost==min_cost) cout<<" "<<i;
}
cout<<endl;
}
if(rounds!=cases) cout<<endl;
}
}
return 0;
}
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n,arr[101],times=1;
while(cin>>n)
{
int flag=1;
for(int i=0;i<n;i++)
cin>>arr[i];
for(int i=0;i<n-1;i++)
{
if(arr[i]>0&&arr[i]<arr[i+1]);
else flag=0;
}
vector<int> sq;
for(int i=0;i<n;i++)
{
for(int j=i;j<n;j++)
{
if(find(sq.begin(),sq.end(),arr[i]+arr[j])!=sq.end())
flag=0;
else
sq.push_back(arr[i]+arr[j]);
}
}
cout<<"Case #"<<times++<<": ";
if(flag==0) cout<<"It is not a B2-Sequence."<<endl;
else cout<<"It is a B2-Sequence."<<endl;
cout<<endl;
}
return 0;
}
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n,arr[1000001];
while(cin>>n)
{
int A,two=0,three=0;
for(int i=0;i<n;i++)
cin>>arr[i];
sort(arr,arr+n);
if(n%2) // odd
{
A=arr[n/2];
for(int i=0;i<n;i++)
{
if(arr[i]==A) two++;
}
three=1;
}
else // even
{
A=arr[n/2-1];
for(int i=0;i<n;i++)
{
if(arr[i]==arr[n/2]||arr[i]==arr[n/2-1])
two++;
}
three=arr[n/2]-arr[n/2-1]+1;
}
cout<<A<<" "<<two<<" "<<three<<endl;
}
return 0;
}
#include <iostream>
using namespace std;
int main()
{
int f[40],n,num;
f[0]=f[1]=1;
for(int i=2;i<40;i++)
f[i]=f[i-1]+f[i-2];
cin>>n;
while(n--)
{
int start=0;
cin>>num;
cout<<num<<" = ";
for(int i=39;i>=1;i--)
{
if(num/f[i]) cout<<"1",start=1;
else if(start) cout<<"0";
num%=f[i];
}
cout<<" (fib)"<<endl;
}
return 0;
}
#include <iostream>
using namespace std;
int main()
{
int n,m,times=1;
while(cin>>n>>m)
{
if(n==0&&m==0) break;
if(times!=1) cout<<endl;
char map[105][105];
for(int i=0;i<100;i++)
for(int j=0;j<100;j++)
map[i][j]='0';
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
cin>>map[i][j];
cout<<"Field #"<<times++<<":"<<endl;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
if(map[i][j]=='*') cout<<map[i][j];
else
{
int count=0;
for(int x=i-1;x<=i+1;x++)
{
for(int y=j-1;y<=j+1;y++)
{
if(map[x][y]=='*') count++;
}
}
cout<<count;
}
}
cout<<endl;
}
}
return 0;
}
[解二]
#include <iostream>
using namespace std;
int main()
{
int n, m, counter = 1;
int dx[8] = { -1,-1,-1,0,0,1,1,1 }, dy[8] = { -1,0,1,-1,1,-1,0,1 };
while (cin >> n >> m && n && m)
{
if (counter != 1) cout << endl;
char arr[101][101];
for (int i = 0; i < 101; i++)
for (int j = 0; j < 101; j++)
arr[i][j] = '0';
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
cin >> arr[i][j];
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= m; j++)
{
if (arr[i][j] != '*')
{
int total = 0;
for (int k = 0; k < 8; k++)
{
if (arr[i + dx[k]][j + dy[k]] == '*')
total++;
}
arr[i][j] = total + '0';
}
}
}
cout << "Field #" << counter++ << ":" << endl;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= m; j++)
cout << arr[i][j];
cout << endl;
}
}
return 0;
}
#include<iostream>
using namespace std;
typedef struct
{
int x,y;
}Point;
int main()
{
int cases;
char ignore;
cin>>cases;
while(cases--)
{
Point p1,p2,p3;
cin>>p1.x>>ignore>>p1.y>>p2.x>>ignore>>p2.y>>p3.x>>ignore>>p3.y;
double m1,m2;
if((p2.y-p1.y)*(p3.x-p2.x)==(p2.x-p1.x)*(p3.y-p2.y))
cout<<"collinear"<<endl;
else cout<<"not collinear"<<endl;
}
return 0;
}
#include<iostream>
using namespace std;
int a[1000000];
int derivative(int x,int max)
{
long long sum=0,exp=1;
int i;
for(i=max-1;i>=0;i--)
{
sum+=a[i]*exp*(max-i);
exp*=x;
}
return sum;
}
int main()
{
int x,n;
while(cin>>x)
{
for(n=0;;n++)
{
cin>>a[n];
if(getchar()=='\n')
break;
}
cout<<derivative(x,n)<<endl;
}
return 0;
}
#include <iostream>
using namespace std;
int main()
{
srand(time(NULL));
int index[18]={0},counter=0;
char map[6][6]={'*'},alpha[6][6];
for(int i=0;i<6;i++)
for(int j=0;j<6;j++)
map[i][j]='*',alpha[i][j]='*';
for(int i=0;i<6;i++)
{
for(int j=0;j<6;j++)
{
int letter=rand()%18;
while(index[letter]>=2)
letter=rand()%18;
alpha[i][j]=char(letter+'A');
index[letter]++;
}
}
for(int i=0;i<6;i++)
{
for(int j=0;j<6;j++)
cout<<alpha[i][j]<<" ";
cout<<endl;
}
while(counter<36)
{
int cardIndex1,cardIndex2;
cout<<"Please enter card index: ";
cin>>cardIndex1;
for(int i=0;i<6;i++)
{
for(int j=0;j<6;j++)
{
if(cardIndex1/6==i&&cardIndex1%6==j)
cout<<alpha[i][j]<<" ";
else
cout<<map[i][j]<<" ";
}
cout<<endl;
}
cout<<"Please enter card index: ";
cin>>cardIndex2;
for(int i=0;i<6;i++)
{
for(int j=0;j<6;j++)
{
if(cardIndex1/6==i&&cardIndex1%6==j)
cout<<alpha[i][j]<<" ";
else if(cardIndex2/6==i&&cardIndex2%6==j)
cout<<alpha[i][j]<<" ";
else
cout<<map[i][j]<<" ";
}
cout<<endl;
}
if(alpha[cardIndex1/6][cardIndex1%6]==alpha[cardIndex2/6][cardIndex2%6])
{
cout<<"Good Job!"<<endl;
counter+=2;
map[cardIndex1/6][cardIndex1%6]=alpha[cardIndex1/6][cardIndex1%6];
map[cardIndex2/6][cardIndex2%6]=alpha[cardIndex2/6][cardIndex2%6];
}
else cout<<"Try Again!"<<endl;
}
cout<<"Congratulation!!"<<endl;
}
#include <iostream>
using namespace std;
int main()
{
int t,m,n,q,r,c;
cin>>t;
while(t--)
{
char map[100][100]={'0'};
cin>>m>>n>>q;
cout<<m<<" "<<n<<" "<<q<<endl;
for(int i=0;i<m;i++)
for(int j=0;j<n;j++)
cin>>map[i][j];
while(q--)
{
cin>>r>>c;
int length=0,out=0;
char target=map[r][c];
while(1)
{
int i,j;
for(i=r-length;i<=r+length;i++)
{
for(j=c-length;j<=c+length;j++)
{
if(map[i][j]!=target)
{
out=1;
break;
}
else if(i<0||j<0||i>=m||j>=n)
{
out=1;
break;
}
}
if(out) break;
}
if(out)
{
length--;
break;
}
length++;
}
cout<<length*2+1<<endl;
}
}
return 0;
}
#include <iostream>
#include <iomanip>
using namespace std;
typedef struct
{
double x,y;
}Point;
int main()
{
Point p1,p2,p3,p4;
cout<<fixed<<setprecision(3);
while(cin>>p1.x>>p1.y>>p2.x>>p2.y>>p3.x>>p3.y>>p4.x>>p4.y)
{
if(p1.x==p3.x&&p1.y==p3.y) swap(p1,p2);
else if(p1.x==p4.x&&p1.y==p4.y) swap(p1,p2),swap(p3,p4);
else if(p2.x==p4.x&&p2.y==p4.y) swap(p3,p4);
Point p5;
p5.x=p1.x+p4.x-p2.x;
p5.y=p1.y+p4.y-p2.y;
cout<<p5.x<<" "<<p5.y<<endl;
}
return 0;
}
#include <iostream>
#include <string>
using namespace std;
int main()
{
string s;
getline(cin,s);
for(int i=0;i<s.size();i++)
{
if(s[i]==' ')
{
//cout<<s<<endl;
continue;
}
for(int j=0;j<s.size();j++)
{
if(s[j]==' ') cout<<s[j];
else if(i==j) // capital
{
if('a'<=s[j]&&s[j]<='z') cout<<char(s[j]-'a'+'A');
else cout<<s[j];
}
else //non-capital
{
if('a'<=s[j]&&s[j]<='z') cout<<s[j];
else cout<<char(s[j]-'A'+'a');
}
}
cout<<endl;
}
return 0;
}
#include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
int main()
{
double s,n,p,k,q;
cin>>s;
cout<<fixed<<setprecision(4);
while(s--)
{
double r,a0;
cin>>n>>p>>k;
q=1-p;
if(pow(q,n)==1)
cout<<"0.0000"<<endl;
else
cout<<p*pow(q,k-1)/(1-pow(q,n))<<endl;
}
return 0;
}
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n,tmp;
while(cin>>n)
{
vector<int> sq;
vector<int> diff;
for(int i=0;i<n;i++)
{
cin>>tmp;
sq.push_back(tmp);
}
for(int i=0;i<sq.size()-1;i++)
diff.push_back(abs(sq[i]-sq[i+1]));
sort(diff.begin(),diff.end());
int i;
for(i=0;i<n-1;i++)
{
if(i+1!=diff[i]) break;
}
if(i==n-1) cout<<"Jolly"<<endl;
else cout<<"Not jolly"<<endl;
}
return 0;
}
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int r,cases,n,mid;
cin>>cases;
while(cases--)
{
cin>>r;
vector<int> nightbor;
for(int i=0;i<r;i++)
{
cin>>n;
nightbor.push_back(n);
}
sort(nightbor.begin(),nightbor.end());
mid=r/2;
int sum=0;
for(int i=0;i<nightbor.size();i++)
{
sum+=abs(nightbor[i]-nightbor[mid]);
}
cout<<sum<<endl;
}
return 0;
}
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int n,m;
while(cin>>n>>m)
{
vector<int> sq;
if(n<=1||m<=1)
{
cout<<"Boring!"<<endl;
continue;
}
while(n%m==0)
{
sq.push_back(n);
n/=m;
}
if(n!=1) cout<<"Boring!"<<endl;
else
{
for(int i=0;i<sq.size();i++)
{
if(i!=sq.size()-1)
cout<<sq[i]<<" ";
else
cout<<sq[i]<<" 1"<<endl;
}
}
}
return 0;
}
#include <iostream>
#include <string>
#include <cmath>
#include <iomanip>
using namespace std;
#define PI 2*acos(0)
int main()
{
double s,a;
string type;
cout<<fixed<<setprecision(6);
while(cin>>s>>a>>type)
{
if(a>180) a=360-a;
if(type=="min") a/=60;
cout<<2*PI*(s+6440)*(a/360.0)<<" "<<2*sin(a/2.0*PI/180)*(6440+s)<<endl;
}
return 0;
}
#include <iostream>
#include <string>
using namespace std;
int main()
{
int count=0;
string text;
while(getline(cin,text))
{
for(int i=0;i<text.size();i++)
{
if(text[i]=='"')
{
if(count%2==0) cout<<"``";
else cout<<"''";
count++;
}
else
cout<<text[i];
}
cout<<endl;
}
return 0;
}
#include <iostream>
#include <cmath>
using namespace std;
int isPrime(int n)
{
for(int i=2;i<=n/2;i++)
{
if(n%i==0)
return 0;
}
return 1;
}
int main()
{
int n;
while(cin>>n)
{
int reverse=0,copy=n;
while(copy>0)
{
reverse=reverse*10+copy%10;
copy/=10;
}
if(isPrime(n)&&isPrime(reverse)&&n!=reverse)
cout<<n<<" is emirp."<<endl;
else if(isPrime(n))
cout<<n<<" is prime."<<endl;
else
cout<<n<<" is not prime."<<endl;
}
return 0;
}
#include <iostream>
#include <string>
#include <vector>
#include <iomanip>
using namespace std;
int main()
{
int cases;
cin>>cases;
string tree,ignore;;
getline(cin,ignore);
cin.ignore();
for(int i=0;i<cases;i++)
{
vector<string> species;
vector<int> amounts;
int total=0;
while(getline(cin,tree))
{
if(tree.size()==0) break;
total++;
int l=0;
for(l=0;l<species.size();l++)
{
if(species[l]==tree)
{
amounts[l]++;
break;
}
}
if(l==species.size())
{
species.push_back(tree);
amounts.push_back(1);
}
}
for(int j=0;j<species.size();j++)
{
for(int k=0;k<species.size();k++)
{
if(species[j]<species[k])
{
swap(species[j],species[k]);
swap(amounts[j],amounts[k]);
}
}
}
for(int j=0;j<species.size();j++)
cout<<species[j]<<" "<<fixed<<setprecision(4)<<amounts[j]/float(total)*100<<endl;
if(i!=cases-1)
cout<<endl;
}
return 0;
}
#include <iostream>
#include <string>
using namespace std;
int main()
{
int l=0,w=0;
string s[100],temp;
while(getline(cin,temp))
{
s[l++]=temp;
if(temp.size()>w) w=temp.size();
}
for(int i=0;i<w;i++)
{
for(int j=l-1;j>=0;j--)
{
if(s[j].size()>i)
cout<<s[j][i];
else
cout<<" ";
}
cout<<endl;
}
return 0;
}
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int a,b;
while(cin>>a>>b)
{
if(a==0&&b==0) break;
int sum=0;
for(int i=a;i<=b;i++)
{
int sr=sqrt(i);
if(sr*sr==i)
sum++;
}
cout<<sum<<endl;
}
return 0;
}
#include <iostream>
#include <string>
using namespace std;
int main()
{
int l;
while(cin>>l)
{
int parity=0;
string binary;
if(l==0) break;
cout<<"The parity of ";
while(l>0)
{
binary=(l%2==0?"0":"1")+binary;
if(l%2) parity++;
l/=2;
}
cout<<binary<<" is "<<parity<<" (mod 2)."<<endl;
}
}
#include <iostream>
#include <string>
using namespace std;
int main()
{
string a,b;
while(getline(cin,a))
{
getline(cin,b);
int index1[26]={0},index2[26]={0};
for(int i=0;i<a.size();i++)
index1[a[i]-'a']++;
for(int i=0;i<b.size();i++)
index2[b[i]-'a']++;
for(int i=0;i<26;i++)
{
if(index1[i]&&index2[i])
{
int len=index1[i]<index2[i]?index1[i]:index2[i];
for(int j=0;j<len;j++)
cout<<char('a'+i);
}
}
cout<<endl;
}
}
#include <iostream>
using namespace std;
int main()
{
unsigned long long int s,d;
while(cin>>s>>d)
{
unsigned long long int days=0;
while(days<d)
{
days+=s;
s++;
}
cout<<s-1<<endl;
}
}
#include <iostream>
using namespace std;
int main()
{
int w,h,n,target=0;
cin>>w>>h>>n;
char map[10][10];
for(int i=0;i<w;i++)
{
for(int j=0;j<h;j++)
{
cin>>map[i][j];
if(map[i][j]!='0') target++;
}
}
if(n>target) cout<<"Mission fail."<<endl;
else
{
char object='a';
for(int i=0;i<26;i++)
{
for(int j=0;j<w;j++)
{
for(int k=0;k<h&&n>0;k++)
{
if(map[j][k]==char(object+i))
{
cout<<j<<" "<<k<<endl;
n--;
break;
}
}
}
}
}
}
#include <iostream>
#include <string>
using namespace std;
int main()
{
string s;
while(cin>>s)
{
if(s=="0") break;
cout<<s<<" is ";
int times=1,sum=0;
for(int i=0;i<s.size();i++)
sum+=s[i]-'0';
while(sum>=10)
{
times++;
int copy=0;
while(sum>0)
{
copy+=sum%10;
sum/=10;
}
sum=copy;
}
if(sum!=9) cout<<"not a multiple of 9."<<endl;
else cout<<"a multiple of 9 and has 9-degree "<<times<<".\n";
}
}
#include <iostream>
using namespace std;
int main()
{
int n;
while(cin>>n)
{
if(n==0) break;
while(n>=10)
n=n%10+n/10;
cout<<n<<endl;
}
}
#include <string>
#include <iostream>
using namespace std;
int main()
{
int command,sum=0,order;
string menu1[5]={"Medium Wac","WChicken Nugget","Geez Burger","ButtMilk Crispy Chicken","Plastic Toy"};
string menu2[4]={"German Fries","Durian Slices","WcFurry","Chocolate Sunday"};
int price1[5]={4,8,7,6,3},price2[4]={2,3,5,7};
while(cin>>command)
{
if(command==0) break;
else if(command==1)
{
cin>>order;
cout<<menu1[order-1]<<" "<<price1[order-1]<<endl;
sum+=price1[order-1];
}
else if(command==2)
{
cin>>order;
cout<<menu2[order-1]<<" "<<price2[order-1]<<endl;
sum+=price2[order-1];
}
}
cout<<"Total: "<<sum<<endl;
return 0;
}
#include <iostream>
#include <iomanip>
using namespace std;
void bangla(unsigned long long int n)
{
if(n==0) return;
if(n/10000000)
{
bangla(n/10000000);
cout<<" kuti";
n%=10000000;
}
if(n/100000)
{
bangla(n/100000);
cout<<" lakh";
n%=100000;
}
if(n/1000)
{
bangla(n/1000);
cout<<" hajar";
n%=1000;
}
if(n/100)
{
bangla(n/100);
cout<<" shata";
n%=100;
}
if(n) cout<<" "<<n;
}
int main()
{
int times=1;
unsigned long long int n;
while(cin>>n)
{
cout<<setw(4)<<times++<<".";
if(n==0) cout<<" 0";
bangla(n);
cout<<endl;
}
return 0;
}
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int t,n;
cin>>t;
for(int i=0;i<t;i++)
{
int b1=0,copy,b2=0;
cin>>n;
copy=n;
while(copy>0)
{
b1+=copy%2;
copy/=2;
}
copy=n;
int times=0,x2=0;
while(copy>0)
{
x2+=pow(16,times)*(copy%10);
times++;
copy/=10;
}
copy=x2;
while(copy>0)
{
b2+=copy%2;
copy/=2;
}
cout<<b1<<" "<<b2<<endl;
}
return 0;
}
#include <iostream>
using namespace std;
int main()
{
int n;
while(cin>>n)
{
cout<<(int)(n*1.5)<<endl;
}
return 0;
}
#include <iostream>
#include <string>
using namespace std;
int main()
{
int t;
cin>>t;
getchar();
string c="0111001111",d="0111001110",e="0111001100",f="0111001000",g="0111000000",
a="0110000000",b="0100000000",C="0010000000",D="1111001110",E="1111001100",F="1111001000",
G="1111000000",A="1110000000",B="1100000000";
for(int i=0;i<t;i++)
{
int count[10]={0};
string s,finger="0000000000";
getline(cin,s);
if(s[0]=='c') finger=c;
else if(s[0]=='d') finger=d;
else if(s[0]=='e') finger=e;
else if(s[0]=='f') finger=f;
else if(s[0]=='g') finger=g;
else if(s[0]=='a') finger=a;
else if(s[0]=='b') finger=b;
else if(s[0]=='C') finger=C;
else if(s[0]=='D') finger=D;
else if(s[0]=='E') finger=E;
else if(s[0]=='F') finger=F;
else if(s[0]=='G') finger=G;
else if(s[0]=='A') finger=A;
else if(s[0]=='B') finger=B;
for(int j=0;j<10;j++)
{
if(finger[j]=='1') count[j]++;
}
for(int j=1;j<s.size();j++)
{
string next;
if(s[j]=='c') next=c;
else if(s[j]=='d') next=d;
else if(s[j]=='e') next=e;
else if(s[j]=='f') next=f;
else if(s[j]=='g') next=g;
else if(s[j]=='a') next=a;
else if(s[j]=='b') next=b;
else if(s[j]=='C') next=C;
else if(s[j]=='D') next=D;
else if(s[j]=='E') next=E;
else if(s[j]=='F') next=F;
else if(s[j]=='G') next=G;
else if(s[j]=='A') next=A;
else if(s[j]=='B') next=B;
for(int k=0;k<10;k++)
{
if(finger[k]=='0'&&next[k]=='1') count[k]++;
}
finger=next;
}
for(int i=0;i<10;i++)
{
if(i!=9)
cout<<count[i]<<" ";
else
cout<<count[i]<<endl;
}
}
return 0;
}
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int t;
cin>>t;
for(int i=0;i<t;i++)
{
int n,p,h,ans=0;
cin>>n>>p;
vector<int> party;
for(int j=0;j<p;j++)
{
cin>>h;
party.push_back(h);
}
for(int j=1;j<=n;j++)
{
for(int k=0;k<party.size();k++)
{
if(j%party[k]==0&&j%7!=6&&j%7!=0)
{
ans++;
break;
}
}
}
cout<<ans<<endl;
}
return 0;
}
#include <iostream>
using namespace std;
int GCD(int a,int b)
{
while((a%=b)!=0&&(b%=a)!=0);
return a+b;
}
int main()
{
int N;
while(cin>>N&&N!=0)
{
int G=0;
for(int i=1;i<N;i++)
{
for(int j=i+1;j<=N;j++)
{
G+=GCD(i,j);
}
}
cout<<G<<endl;
}
return 0;
}
#include <iostream>
using namespace std;
int main()
{
int n;
while(cin>>n)
{
for(int i=1;i<=n;i++)
{
int x1,y1,x2,y2;
cin>>x1>>y1>>x2>>y2;
long long int step1=(x1+y1)*(x1+y1+1ll)/2+x1;
long int step2=(x2+y2)*(x2+y2+1ll)/2+x2;
cout<<"Case "<<i<<": "<<abs(step1-step2)<<endl;
}
}
return 0;
}
#include <iostream>
#include <string>
using namespace std;
int main()
{
string s;
while(getline(cin,s))
{
string index="`1234567890-=qwertyuiop[]\\asdfghjkl;'zxcvbnm,./";
for(int i=0;i<s.size();i++)
{
if(s[i]==' '||s[i]=='\n') cout<<s[i];
else
{
for(int j=0;j<index.size();j++)
{
if(s[i]==index[j])
cout<<index[j-2];
}
}
}
cout<<endl;
}
return 0;
}
#include <iostream>
#include <string>
#include <sstream>
using namespace std;
int main()
{
string s;
while(getline(cin,s))
{
stringstream ss;
string one,two,operation;
ss<<s;
ss>>one;
cout<<one;
while(ss>>operation>>two)
{
if(operation=="or") cout<<"||";
else cout<<"&&";
cout<<two;
if(operation=="or")
{
for(int i=0;i<5;i++)
{
if(one[i]=='1'||two[i]=='1') one[i]='1';
else one[i]='0';
}
}
if(operation=="and")
{
for(int i=0;i<5;i++)
{
if(one[i]=='1'&&two[i]=='1') one[i]='1';
else one[i]='0';
}
}
}
cout<<" = "<<one<<endl;
}
return 0;
}
#include <iostream>
#include <string>
using namespace std;
int main()
{
int cases=1;
string s;
while(cin>>s)
{
if(s=="#") break;
cout<<"Case "<<cases++<<": ";
if(s=="HELLO") cout<<"ENGLISH"<<endl;
else if(s=="HOLA") cout<<"SPANISH"<<endl;
else if(s=="HALLO") cout<<"GERMAN"<<endl;
else if(s=="BONJOUR") cout<<"FRENCH"<<endl;
else if(s=="CIAO") cout<<"ITALIAN"<<endl;
else if(s=="ZDRAVSTVUJTE") cout<<"RUSSIAN"<<endl;
else cout<<"UNKNOWN"<<endl;
}
return 0;
}
#include <iostream>
#include <string>
using namespace std;
int main()
{
string n;
while(cin>>n)
{
if(n=="0") break;
int even=0,odd=0;
for(int i=0;i<n.size();i++)
{
if(i%2) odd+=n[i]-'0';
else even+=n[i]-'0';
}
if(abs(even-odd)%11==0) cout<<n<<" is a multiple of 11."<<endl;
else cout<<n<<" is not a multiple of 11."<<endl;
}
return 0;
}
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int n;
while(cin>>n)
{
for(int i=0;i<n;i++)
{
double ax,ay,bx,by,cx,cy;
cin>>ax>>ay>>bx>>by>>cx>>cy;
double area=fabs(ax*by-ay*bx+bx*cy-by*cx+cx*ay-cy*ax)/14;
area>=0?area:-1*area;
cout<<(int)(area+0.5)<<endl;
}
}
return 0;
}
#include <iostream>
#include <string>
#include <sstream>
#include <vector>
using namespace std;
int main()
{
int n;
string name,s;
stringstream ss;
vector<string> l;
getline(cin,s);
cin>>n;
ss<<s;
while(ss>>name)
l.push_back(name);
cout<<l[l.size()-n]<<endl;
return 0;
}
#include <iostream>
#include <cmath>
#include <string>
using namespace std;
int main()
{
int n;
while(cin>>n)
{
string s;
for(int i=0;i<n;i++)
s+="0";
for(int i=0;i<pow(2,n);i++)
{
cout<<s<<endl;
s[s.size()-1]++;
for(int j=s.size()-1;j>=0;j--)
{
if(s[j]>'1')
{
s[j-1]++;
s[j]='0';
}
}
}
}
return 0;
}
#include <iostream>
using namespace std;
int main()
{
int t;
while(cin>>t)
{
for(int i=1;i<=t;i++)
{
int a,b,sum=0;
cin>>a>>b;
for(int j=a;j<=b;j++)
{
if(j%2) sum+=j;
}
cout<<"Case "<<i<<": "<<sum<<endl;
}
}
return 0;
}
#include <iostream>
using namespace std;
int main()
{
int n;
while(cin>>n)
{
for(int i=0;i<n;i++)
{
int s,d,team1,team2;
cin>>s>>d;
team1=(s+d)/2;
team2=(s-d)/2;
if(team1<0||team2<0||(s+d)%2||abs((s-d)%2))
cout<<"impossible"<<endl;
else
{
if(team1<team2) swap(team1,team2);
cout<<team1<<" "<<team2<<endl;
}
}
}
return 0;
}
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
int n;
string s,ignore;
vector<string> country;
vector<int> times;
while(cin>>n)
{
for(int i=0;i<n;i++)
{
cin>>s;
cin.ignore();
getline(cin,ignore);
if(find(country.begin(),country.end(),s)==country.end())
country.push_back(s),times.push_back(1);
else
{
int l=0;
for(auto it:country)
{
if(it==s)
break;
l++;
}
times[l]++;
}
}
for(int i=0;i<country.size();i++)
{
for(int j=0;j<country.size();j++)
{
if(country[i]<country[j])
{
swap(country[i],country[j]);
swap(times[i],times[j]);
}
}
}
for(int i=0;i<country.size();i++)
cout<<country[i]<<" "<<times[i]<<endl;
}
return 0;
}
#include <iostream>
using namespace std;
int main()
{
int v,t;
while(cin>>v>>t)
{
cout<<2*v*t<<endl;
}
return 0;
}
#include <iostream>
#include <string>
using namespace std;
int main()
{
string a,b;
while(cin>>a>>b)
{
if(a=="0"&&b=="0") break;
int operation = 0;
if(a.size()>b.size()) swap(a,b);
for(int i=0;i<a.size();i++)
{
b[b.size()-i-1]=b[b.size()-i-1]+a[a.size()-i-1]-'0';
if(b[b.size()-i-1]>'9')
{
b[b.size()-i-1]=(b[b.size()-i-1]-'0')%10+'0';
b[b.size()-i-2]++;
operation++;
}
}
for(int i=b.size()-1;i>=0;i--)
{
if(b[i]>'9')
{
b[i]=(b[i]-'0')%10+'0';
b[i-1]++;
operation++;
}
}
if(operation==0) cout<<"No carry operation."<<endl;
else if(operation==1) cout<<"1 carry operation."<<endl;
else cout<<operation<<" carry operations."<<endl;
}
return 0;
}
#include <iostream>
using namespace std;
int main()
{
long long int a,b;
while(cin>>a>>b)
{
cout<<abs(a-b)<<endl;
}
return 0;
}
#include <iostream>
#include <string>
using namespace std;
int main()
{
string s;
while(getline(cin,s))
{
int count[128]={0};
for(int i=0;i<s.size();i++)
count[s[i]]++;
for(int i=1;i<=1000;i++)
{
for(int j=127;j>=0;j--)
{
if(count[j]==i)
cout<<j<<" "<<i<<endl;
}
}
cout<<endl;
}
return 0;
}
#include <iostream>
using namespace std;
int main()
{
int a,b;
while(cin>>a>>b)
{
int max_times=1;
cout<<a<<" "<<b<<" ";
if(a>b) swap(a,b);
for(int i=a;i<=b;i++)
{
int times=1,n=i;
while(n!=1)
{
times++;
if(n%2) n=3*n+1;
else n=n/2;
}
if(times>max_times) max_times=times;
}
cout<<max_times<<endl;
}
return 0;
}
#include <iostream>
#include <string>
using namespace std;
int main()
{
int n;
while(cin>>n)
{
cin.ignore();
string text;
char alphabet[26];
int count[26]={0};
for(int j=0;j<26;j++)
alphabet[j]=(char)('A'+j);
for(int i=0;i<n;i++)
{
getline(cin,text);
for(int j=0;j<text.size();j++)
{
if(isalpha(text[j])&&islower(text[j]))
count[text[j]-'a']++;
else if(isalpha(text[j])&&isupper(text[j]))
count[text[j]-'A']++;
}
}
for(int i=0;i<26;i++)
{
for(int j=0;j<26;j++)
{
if(count[i]>count[j])
{
swap(count[i],count[j]);
swap(alphabet[i],alphabet[j]);
}
else if(count[i]==count[j]&&alphabet[i]<alphabet[j])
{
swap(count[i],count[j]);
swap(alphabet[i],alphabet[j]);
}
}
}
for(int i=0;i<26;i++)
{
if(count[i]>0)
cout<<alphabet[i]<<" "<<count[i]<<endl;
}
}
return 0;
}
#include <iostream>
using namespace std;
int main()
{
long long int A,hour,mintue,second;
while(cin>>A)
{
second=A%60;
A/=60;
mintue=A%60;
A/=60;
hour=A;
cout << hour << " hours " << mintue << " mintues and " << second << " seconds" << endl;
}
return 0;
}
#include <iostream>
#include <iomanip>
using namespace std;
int main()
{
double n,r,guess,pre_guess;
while(cin>>n)
{
guess=n/2;
do{
r=n/guess;
pre_guess=guess;
guess=(guess+r)/2;
}while(pre_guess-guess>=0.01);
cout << fixed << setprecision(2) << guess << endl;
}
return 0;
}
#include <iostream>
using namespace std;
int gcd(int a, int b)
{
while ((a %= b) != 0 && (b %= a) != 0);
return a + b;
}
int main() {
int a, b;
while (cin >> a >> b)
{
cout << gcd(a, b) << endl;
}
return 0;
}
#include <iostream>
#include "BankAccount.h"
using namespace std;
int main() {
BankAccount bankAccount1(200), bankAccount2, bankAccount3(-100);
cout << BankAccount::getAllMoneyInBank() << endl;
bankAccount1.withdraw(100);
cout << bankAccount1.getBalance() << endl;
cout << BankAccount::getAllMoneyInBank() << endl;
bankAccount2.save(50);
cout << bankAccount2.getBalance() << endl;
cout << BankAccount::getAllMoneyInBank() << endl;
return 0;
}
#pragma once
class BankAccount {
private:
int balance;
static int total;
public:
BankAccount()
{
balance = 0;
}
BankAccount(int input)
{
balance = input;
total += input;
}
void withdraw(int output);
void save(int input);
int getBalance() { return balance; }
static int getAllMoneyInBank() { return total; }
};
#include"BankAccount.h"
int BankAccount::total = 0;
void BankAccount::withdraw(int output)
{
balance -= output;
total -= output;
}
void BankAccount::save(int input)
{
balance += input;
total += input;
}
#include <iostream>
using namespace std;
int main() {
int a, b;
while (cin >> a >> b)
{
int maxCycleLength = 0, cycleLength = 0, n;
cout << a << " " << b << " ";
if (a > b)
swap(a, b);
for (int i = a; i <= b; i++)
{
n = i;
cycleLength = 1;
while (n != 1)
{
if (n % 2) // even
n = 3 * n + 1;
else //odd
n = n / 2;
cycleLength++;
}
maxCycleLength = cycleLength > maxCycleLength ? cycleLength : maxCycleLength;
}
cout << maxCycleLength << endl;
}
return 0;
}
#include <iostream>
#include "Fraction.h"
using namespace std;
int main()
{
Fraction f1, f2;
f1.setNumerator(4);
f1.setDenominator(2);
f1.getDouble();
f1.outputReducedFraction();
f2.setNumerator(20);
f2.setDenominator(60);
f2.getDouble();
f2.outputReducedFraction();
system("pause");
return 0;
}
#ifndef Fraction_H
#define Fraction_H
#include <iostream>
#include <iomanip>
using namespace std;
class Fraction
{
private:
int numerator;
int denominator;
public:
void setNumerator(int nu);
void setDenominator(int de);
void getDouble();
void outputReducedFraction();
};
#endif //Fraction_H
#include "Fraction.h"
int gcd(int a, int b)
{
while ((a %= b) != 0 && (b %= a) != 0);
return a + b;
}
void Fraction::setNumerator(int nu)
{
numerator = nu;
}
void Fraction::setDenominator(int de)
{
denominator = de;
}
void Fraction::getDouble()
{
if (!(numerator % denominator)) // integer
cout << numerator / denominator << endl;
else
cout << fixed << setprecision(6) << (double)numerator / denominator << endl;
}
void Fraction::outputReducedFraction()
{
int greattestCommonDivisor = gcd(numerator, denominator);
if (!(numerator % denominator)) // integer
cout << numerator / denominator << endl;
else
cout << numerator / greattestCommonDivisor << "/" << denominator / greattestCommonDivisor << endl;
}
#include <iostream>
#include "Point.h"
using namespace std;
int main(void) {
Point point;
point.Set(0, 5);
cout << point.RetrieveVertical() << " " << point.RetrieveHorizontal() << endl;
point.Move(1, 2);
cout << point.RetrieveVertical() << " " << point.RetrieveHorizontal() << endl;
for (int i = 0; i < 4; i++) {
point.Rotate();
cout << point.RetrieveVertical() << " " << point.RetrieveHorizontal() << endl;
}
return 0;
}
#include "Point.h"
void Point::Set(int x, int y)
{
vertical = x;
horizontal = y;
}
void Point::Move(int x, int y)
{
vertical += x;
horizontal += y;
}
void Point::Rotate()
{
int temp = vertical;
vertical = horizontal;
horizontal = temp * (-1);
}
#ifndef Point_H
#define Point_H
#include <iostream>
using namespace std;
class Point
{
private:
int vertical;
int horizontal;
public:
Point()
{
vertical = 0;
horizontal = 0;
}
void Set(int vertical, int horizontal);
void Move(int x, int y);
void Rotate();
int RetrieveVertical() const { return vertical; }
int RetrieveHorizontal() const { return horizontal; }
};
#endif //Point_H
#include <iostream>
#include <string>
using namespace std;
int main() {
long long int k;
string plaintext;
while (getline(cin, plaintext))
{
cin >> k;
cin.ignore();
for (int i = 0; i < plaintext.size(); i++)
{
if ('a' <= plaintext[i] && plaintext[i] <= 'z')
{
plaintext[i] = (plaintext[i] - 'a' + k + 208827064576) % 26 + 'a';
}
else if (plaintext[i] != ' ')
plaintext[i] += 'a';
}
cout << plaintext << endl;
}
return 0;
}
#include <iostream>
#include <string>
#include <sstream>
#include <vector>
using namespace std;
int main() {
string plaintext;
stringstream ss;
while (getline(cin, plaintext))
{
int temp, row = 0;
vector<int> key;
string s;
ss.clear();
ss.str("");
getline(cin, s);
ss << s;
while (ss >> temp) // get each key
{
key.push_back(temp);
row++;
}
char array[10000][10000] = { '\0' };
for (int i = 0; i < plaintext.size(); i++) // replace the data
{
if (plaintext[i] == ' ')
array[i % row][i / row] = '_';
else
array[i % row][i / row] = plaintext[i];
}
for (int i = 0; i < row; i++)
{
for (int j = 0;; j++)
{
if (array[key[i]][j] != '\0')
cout << array[key[i]][j];
else
break;
}
}
//for (int i = 0; i < row; i++) // for test
//{
// for (int j = 0; j < row; j++)
// cout << array[i][j];
// cout << endl;
//}
cout << endl;
}
return 0;
}
#include <iostream>
#include <string>
using namespace std;
void findPosition(char c,char table[5][5],int &x,int &y)
{
for (int i = 0; i < 5; i++)
{
for (int j = 0; j < 5; j++)
{
if (c == table[i][j])
{
x = i, y = j;
return;
}
}
}
}
int main() {
string plaintext, key;
while (cin >> plaintext >> key)
{
char table[5][5] = {'\0'};
int alphabetIndex[26] = { 0 }; // check if alphabet is recorded in table
alphabetIndex['j' - 'a'] = 1; // aviod error
int currentRow = 0, currentColumn = 0, currentPoint = 0; // current recorded position
string answer = "";
for (int i = 0; i < key.size(); i++)
{
if (alphabetIndex[key[i] - 'a'] == 0) // if new
{
table[currentRow][currentColumn] = key[i];
currentColumn++;
if (currentColumn >= 5) // next line
{
currentColumn %= 5;
currentRow++;
}
}
if (key[i] == 'j' && alphabetIndex['i' - 'a'] == 0) // 'j' case
{
table[currentRow][currentColumn] = 'i';
currentColumn++;
if (currentColumn >= 5) // next line
{
currentColumn %= 5;
currentRow++;
}
alphabetIndex['i' - 'a']++;
}
alphabetIndex[key[i] - 'a']++; // increase index record
}
for (int i = 0; i < 26; i++) //fill the table
{
if (alphabetIndex[i] == 0)
{
table[currentRow][currentColumn] = (i + 'a');
currentColumn++;
if (currentColumn >= 5) // next line
{
currentColumn %= 5;
currentRow++;
}
}
}
while (currentPoint <= plaintext.size() - 1) // encode
{
int c1Row = 0, c1Column = 0, c2Row = 0, c2Column = 0;
if (currentPoint == plaintext.size()-1)
{
findPosition(plaintext[currentPoint], table, c1Row, c1Column);
findPosition('x', table, c2Row, c2Column);
currentPoint++;
}
else if (plaintext[currentPoint] != plaintext[currentPoint + 1]) // they are different
{
findPosition(plaintext[currentPoint], table, c1Row, c1Column);
findPosition(plaintext[currentPoint + 1], table, c2Row, c2Column);
currentPoint += 2; // to the next point
}
else
{
findPosition(plaintext[currentPoint], table, c1Row, c1Column);
findPosition('x', table, c2Row, c2Column);
currentPoint += 1;
}
if (c1Row == c2Row)
{
answer += table[c1Row][(c1Column + 1) % 5];
answer += table[c2Row][(c2Column + 1) % 5];
}
else if (c1Column == c2Column)
{
answer += table[(c1Row + 1) % 5][c1Column];
answer += table[(c2Row + 1) % 5][c2Column];
}
else
{
answer += table[c1Row][c2Column];
answer += table[c2Row][c1Column];
}
}
cout << answer << endl;
//for (int i = 0; i < 5; i++) // print table
//{
// for (int j = 0; j < 5; j++)
// cout << table[i][j];
// cout << endl;
//}
}
return 0;
}