http://acm.sdibt.edu.cn/vjudge/contest/view.action?cid=2204#overview
A Penney Game
Sample Input
4
1
HHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH
2
TTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTT
3
HHTTTHHTTTHTHHTHHTTHTTTHHHTHTTHTTHTTTHTH
4
HTHTHHHTHHHTHTHHHHTTTHTTTTTHHTTTTHTHHHHT
Sample Output
1 0 0 0 0 0 0 0 38
2 38 0 0 0 0 0 0 0
3 4 7 6 4 7 4 5 1
4 6 3 4 5 3 6 5 6
题意:求TTT, TTH, THT, THH, HTT, HTH, HHT and HHH的个数。
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <deque>
#include <queue>
#include <stack>
using namespace std;
typedef long long ll;
const int MAX=1e9+7;
int main()
{
ll T,ee,i,j,ans=0,x,y,p;
ll a,b,c,d,e,f,g,h;
cin>>T;
while(T--)
{
char s[41];
cin>>ee;
cin>>s;
a=0,b=0,c=0,d=0,e=0,f=0,g=0,h=0;
for(i=0;i<38;i++)
{
if(s[i]=='T'&&s[i+1]=='T'&&s[i+2]=='T')
a++;
else
if(s[i]=='T'&&s[i+1]=='T'&&s[i+2]=='H')
b++;
else
if(s[i]=='T'&&s[i+1]=='H'&&s[i+2]=='T')
c++;
else
if(s[i]=='T'&&s[i+1]=='H'&&s[i+2]=='H')
d++;
else
if(s[i]=='H'&&s[i+1]=='T'&&s[i+2]=='T')
e++;
else
if(s[i]=='H'&&s[i+1]=='T'&&s[i+2]=='H')
f++;
else
if(s[i]=='H'&&s[i+1]=='H'&&s[i+2]=='T')
g++;
else
if(s[i]=='H'&&s[i+1]=='H'&&s[i+2]=='H')
h++;
}
cout<<ee<<" "<<a<<" "<<b<<" "<<c<<" "<<d<<" "<<e<<" "<<f<<" "<<g<<" "<<h<<endl;
}
return 0;
}
B - Nim-B Sum
Sample Input
4
1 2 123 456
2 3 123 456
3 4 123 456
4 5 123 456
Sample Output
1 435
2 300
3 307
4 429
题意:给3个数,p,x,y,要求把p进制的x,y,运算一下(对应位置的和对进制求余),在转换成10进制
For example: NimSum(2, 123, 456) = 1111011¤111001000 = 110110011 = 435
NimSum(3, 123, 456) = 11120¤121220 = 102010 = 300
NimSum(4, 123, 456) = 1323¤13020 = 10303 = 307
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <deque>
#include <queue>
#include <stack>
using namespace std;
typedef long long ll;
const int MAX=1e9+7;
int main()
{
ll T,e,i,j,ans=0,x,y,p;
cin>>T;
while(T--)
{
cin>>e>>p>>x>>y;
ll s1[100]={0},s2[100]={0};
ll len1=0,len2=0;
while(1)
{
if(x==0)
break;
s1[len1++]=x%p;
x/=p;
}
while(1)
{
if(y==0)
break;
s2[len2++]=y%p;
y/=p;
}
// cout<<len1<<" "<<len2<<endl;
// for(i=0;i<len1;i++)
// cout<<s1[i]<<" ";
// cout<<endl;
// for(i=0;i<len2;i++)
// cout<<s2[i]<<" ";
// cout<<endl;
ll len=max(len1,len2);
ll s3[100]={0};
for(i=0;i<len;i++)
{
s3[i]=(s1[i]+s2[i])%p;
}
ans=0;
ll k=1;
for(i=0;i<len;i++)
{
ans+=s3[i]*k;
k*=p;
}
cout<<e<<" "<<ans<<endl;
}
return 0;
}
E - Non-Decreasing Digits
Sample Input
3
1 2
2 3
3 4
Sample Output
1 55
2 220
3 715
题意:输入位数n,要求输出长度为n的不递减的总数
思路:dp[n][m],n是位数,m是开头的值。
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <deque>
#include <queue>
#include <stack>
using namespace std;
typedef long long ll;
const int MAX=1e9+7;
ll dp[65][10];
int main()
{
ll T,e,i,j,k,ans=0,x,y,n;
memset(dp,0,sizeof(dp));
for(i=0;i<=9;i++)
dp[1][i]=1;
for(i=1;i<=65;i++)//位数
{
for(j=0;j<=9;j++)
{
for(k=j;k<=9;k++)//把上一个位数小于等于j的dp全加起来
dp[i+1][j]+=dp[i][k];
}
dp[i][10]=0;//将dp[i][10]存上总和
for(j=0;j<=9;j++)
{
dp[i][10]+=dp[i][j];
}
}
cin>>T;
while(T--)
{
cin>>e>>n;
ans=0;
cout<<e<<" "<<dp[n][10]<<endl;
}
return 0;
}