OJ Board

who can give me some test cases?
help help!!

you should try to change another method to solve this problem

I don't understand some words,below:
To further simplify the problem each cell state will depend only on its previous state and that of its immediate neighbors (the one to the left and the one to the right).

The Identity automaton (every state evolves to itself) has identifier 204.


who can ...

I use formula below,why WA?Thanks in advance!

I use neither of them

I test many cases,the result is right.
example
input:
ABCCDDEEEFFF
output:
66 1
65 1
68 2
67 2
70 3
69 3



why WA?

When I submit ,I select the Language is C ,the judge is
Compile Error ,then I select the Language is C++ ,and the judge is Wrong Answer ,who can help me,Thank you in advance!
[c]# include <stdio.h>
# include <string.h>
struct node
{
char ch;
int fre;
};
int main()
{
char str[1000];
node nod ...

I think so

sohel,Thank you indeed!
I got AC but no ( P.E.)

who can help me? Thanks

# include <stdio.h>
int main()
{
long i,j,n,m;
int num[1000000][2];
scanf("%ld",&n);
for(i=0;i<n;i++)
{
getchar();
scanf("%ld",&m);
for(j=0;j<m;j++)
scanf("%d%d",&num[j][0],&num[j][1]);
for(j=m-1;j>=0;j--)
{
if(num[j][0]+num[j][1]>=10)
{
num[j][0]=num[j][0 ...

I don't think so.
I got AC,and I use "%lu"
# include <stdio.h>
int main()
{
unsigned long num,rev,temp,feng;
unsigned int i,j,k,count,time;
scanf("%d",&time);
for(i=0;i<time;i++)
{
scanf("%lu",&num);
count=0;
while(1)
{
rev=0;
for(j=1000000000;j>0;j=j/10)
{
if(num/j>0)
break ...

With your help I got AC,Thank you indeed!