2030
#include <iostream>
#include <string>
using namespace std;
int main()
{
int n;
cin>>n;
string str;
getchar();
while(n--){
getline(cin,str);
int sum=0;
for(int i=0;i<str.length();i++){
if((str[i]&0x80)&&(str[i+1]&0x80)){
sum++;
i++;
}
}
cout<<sum<<endl;
}
return 0;
}
2032
#include <iostream>
#define maxn 33
using namespace std;
int dp[maxn][maxn];
int main()
{
int n;
while(cin>>n){
memset(dp,0,sizeof(dp));
for(int i=1;i<=n;i++){
for(int j=1;j<=i;j++){
if(j==1){
dp[i][j]=1;
}
else{
dp[i][j]=dp[i-1][j-1]+dp[i-1][j];
}
cout<<dp[i][j];
if(j!=i)
cout<<" ";
}
cout<<endl;
}
cout<<endl;
}
return 0;
}
2037
#include <iostream>
#include <algorithm>
using namespace std;
struct p{
int s,e;
}pp[110];
bool cmp(p a,p b){
if(a.e==b.e)
return a.s>b.s;
return a.e<b.e;
}
int main()
{
int n;
while(cin>>n){
if(!n)
break;
for(int i=1;i<=n;i++){
cin>>pp[i].s>>pp[i].e;
}
sort(pp+1,pp+n+1,cmp);
int sum=0;
int m=0;
for(int i=1;i<=n;i++){
if(pp[i].s>=m){
sum++;
m=pp[i].e;
}
}
cout<<sum<<endl;
}
return 0;
}
1020
#include <iostream>
#include <string>
using namespace std;
int main()
{
int n;
cin>>n;
string s;
int sum;
while(n--){
cin>>s;
sum=1;
for(int i=0;i<s.length();i++){
if(s[i+1]==s[i]){
sum++;
}
else{
if(sum==1){
cout<<s[i];
}
else{
cout<<sum<<s[i];
sum=1;
}
}
}
cout<<endl;
}
return 0;
}