but, I don't understood!
for i:=1 to n do
  begin
   if a[i]=a[i+1] then h:=h+1;
   if a[i]<> a[i+1] then write(h,' ',a[i],' ');
   if a[i]<> a[i+1] then h:=1;
  end;
You must get error in this stroke if a[i]=a[i+1] then h:=h+1; because your for loop is going untill n this must give Indexout of range exception isn't?

System.out.println("Enter no. of test cases");
System.out.println("Enter Integers");

How do you think a robot would distinguish those messages from your real answer.

http://acm.timus.ru/help.aspx?topic=judge
«The program must print only the data that is required by the problem statement. The program must not print any prompts (“Enter N:”). The program must not wait for pressing a key at the end of execution.»

for (i = 0; i < t-1; i++)
        {
            if (a[i] == a[i+1])
            {
                cnt++;
            }
            else
            {
                System.out.print((cnt+1) + " " + a[i] + " ");
                cnt = 0;
            }
            if (t == i + 2)
            {
                System.out.print((cnt+1) + " " + a[i]);
                cnt = 0;
            }
        }
I am not understand this part.

Edited by author 12.06.2016 13:59

nub qlo
int cont=0,num;
        num=vec[0];
        for(int i=0;i<n;i++){
          if(vec[i]==num){
              cont=cont+1;
          }
          if(vec[i]!=num ){
             System.out.printf("%d %d ",cont,num);
              num=vec[i];
              cont=1;
            }

        }
        System.out.printf("%d %d",cont,num);

6
1 1 2 1 1 1
5 1 5 1 BUILD SUCCESSFUL (total time: 6 seconds)

answer ->
2 1 1 2 3 1 BUILD SUCCESSFUL (total time: 4 seconds)


You 're telling the amount of x number on the table, read again the problem, greetings.

Edited by author 26.11.2015 05:52

I write the same logic, but first my code got WA #4. Second is accept! Wtf ? :D
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <map>
#include <stack>
#include <algorithm>
#include <bitset>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <cstdio>
#include <iomanip>

#define F first
#define S second
#define ll long long
#define len length()
#define sqr(x) x*x
#define pb push_back
#define mp make_pair
#define sz(x) ((int) (x).size())
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define bp(x) __builtin_popcount(x)
#define INF numeric_limits<long long int>::max()
#define frp freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#define forit(it, s) for(__typeof(s.begin()) it = s.begin(); it != s.end(); it++)

const int maxn = (int)1e6;
const int mod = (int)1e9 + 7;

using namespace std;

int n;
int cnt=1,ans;
int a[1010];

main(){
    scanf("%d",&n);
    for(int i=1; i <= n; i++){
        scanf("%d",&a[i]);
    }
    for(int i=1; i <= n; i++){
        if(a[i]==a[i+1]){
            cnt++;
            ans=a[i+1];
        }
        else{
            ans=a[i];
            printf("%d %d ",cnt,ans);
            cnt=1;
        }
    }


    return 0;
}

Try
1
4
Answer
1 4

Please explain, why my cod has WT7 and your not)

var a:array[1..1000] of integer;
i,n,k:integer;
Begin
 readln(n);
 for i:=1 to n do begin read(a[i]); end;
 k:=1;
 i:=2;
 while i<=n+2 do
 begin
 if a[i]=a[i-1] then
   begin
    i:=i+1;
    k:=k+1;
   end
 else
   begin
    write(k,' ',a[i-1],' ');
    i:=i+1;
    k:=1;
   end;
 end;
End.

Edited by author 26.11.2012 23:44

Edited by author 26.11.2012 23:44

yes, give 4 test

Edited by author 16.11.2014 02:42

твоя прога не пройдет тест 1 1 2 2 2 1 1 1

All tests are correct