CSUS Programming Contest System
Date: , 2012,  12 14:10:46 EEST
Version 9.2.0 20120201 (Wednesday, February 1st 2012 04:02 UTC) Java ver 1.6.0_32 build 2460 Windows XP 5.1 (x86) 

Clarifications Report

-- 50 clarifications --

  Clarification 1 (Site 1) Clarification-6826510829325343039
           From  : TEAM20 @ site 1 "TUV"
         Problem : General
         Elapsed : 24
           State   : ANSWERED by JUDGE3 @ site 1 checked out by JUDGE3 @ site 1
         To ALL? : true
         Question: vhodyt kym zadachite ot standraten vhod li e ili ot fail s imeto na zada4ata
i razshireni .IN?
         Answer  : standarten vhod i standarten izhod




  Clarification 2 (Site 1) Clarification--2862556827358476364
           From  : TEAM22 @ site 1 "VFU2"
         Problem : H
         Elapsed : 156
           State   : ANSWERED by JUDGE4 @ site 1 checked out by JUDGE4 @ site 1
         To ALL? : false
         Question: Razmerut na failovete koito teglqt Ani i Mitko vinagi li 6te sa v Mbytes?
         Answer  : DA




  Clarification 3 (Site 1) Clarification--6474824768980056341
           From  : TEAM4 @ site 1 "TUG"
         Problem : B
         Elapsed : 219
           State   : ANSWERED by JUDGE3 @ site 1 checked out by JUDGE3 @ site 1
         To ALL? : true
         Question: Ne trqbva li zaqvka 1 da e " 1 v x ", poneje taka e v primerniqt vhod?
         Answer  : Za zadacha B, zaqvka 1 da se 4ete 1 x v, a ne 1 v x (v uslovieto). Gledaite primera, toi e veren! 




  Clarification 4 (Site 1) Clarification--5122707600616329906
           From  : TEAM4 @ site 1 "TUG"
         Problem : D
         Elapsed : 294
           State   : ANSWERED by JUDGE3 @ site 1 checked out by JUDGE3 @ site 1
         To ALL? : false
         Question: Na kompilatora se kompilira programata a sistemata kazva 4e
 ne moje da se kompilira?
         Answer  : pratete d.cpp




  Clarification 5 (Site 1) Clarification-2039717761509729921
           From  : TEAM18 @ site 1 "SU1"
         Problem : G
         Elapsed : 301
           State   : ANSWERED by JUDGE3 @ site 1 checked out by JUDGE3 @ site 1
         To ALL? : true
         Question: v kakuv red se izvejdat dwata stringa
         Answer  : nyama znachenie




  Clarification 6 (Site 1) Clarification-5920419066049079892
           From  : TEAM18 @ site 1 "SU1"
         Problem : G
         Elapsed : 399
           State   : ANSWERED by JUDGE5 @ site 1 checked out by JUDGE5 @ site 1
         To ALL? : false
         Question:    .
         Answer  :      .    .




  Clarification 7 (Site 1) Clarification--2344552078667658077
           From  : TEAM5 @ site 1 "AUBG"
         Problem : H
         Elapsed : 421
           State   : ANSWERED by JUDGE1 @ site 1 checked out by JUDGE1 @ site 1
         To ALL? : false
         Question: Is the speed always given in Kbytes and size in Mbytes?
         Answer  : Yes




  Clarification 8 (Site 1) Clarification-4450932410983772739
           From  : TEAM15 @ site 1 "SHU3"
         Problem : G
         Elapsed : 511
           State   : ANSWERED by JUDGE6 @ site 1 checked out by JUDGE6 @ site 1
         To ALL? : false
         Question: Trqbva li da ima broi testovi primeri ili e samo po 1.
         Answer  : ,      




  Clarification 9 (Site 1) Clarification-3629880809722676207
           From  : TEAM18 @ site 1 "SU1"
         Problem : G
         Elapsed : 536
           State   : ANSWERED by JUDGE5 @ site 1 checked out by JUDGE5 @ site 1
         To ALL? : false
         Question:  428
         Answer  : 




  Clarification 10 (Site 1) Clarification--8957282492364849787
           From  : TEAM19 @ site 1 "SU2"
         Problem : H
         Elapsed : 575
           State   : BEING_ANSWERED checked out by JUDGE1 @ site 1
         To ALL? : false
         Question:      256 kb       
10 mb.          ,
   40  .       
-?
         Answer  : null




  Clarification 11 (Site 1) Clarification-7036170425309253376
           From  : TEAM5 @ site 1 "AUBG"
         Problem : H
         Elapsed : 589
           State   : ANSWERED by JUDGE1 @ site 1 checked out by JUDGE1 @ site 1
         To ALL? : false
         Question: We got compilation error for this problem, and twice for Problem A. But 
we managed to compile both programs on our pc and they both 
passed  the sample tests given in the problem set. Why do we get
compilation error?
         Answer  : No coment




  Clarification 12 (Site 1) Clarification-3240519376792751661
           From  : TEAM40 @ site 1 "team40"
         Problem : G
         Elapsed : 594
           State   : ANSWERED by JUDGE3 @ site 1 checked out by JUDGE3 @ site 1
         To ALL? : false
         Question: Kolko e maximalnata dylzhina na stringovete vyv vhoda?
         Answer  : No comment




  Clarification 13 (Site 1) Clarification--1553794148685690819
           From  : TEAM12 @ site 1 "TUS2"
         Problem : H
         Elapsed : 610
           State   : ANSWERED by JUDGE5 @ site 1 checked out by JUDGE5 @ site 1
         To ALL? : false
         Question: chestotna lenta 256Kbytes oznachava li 256kb/s
         Answer  : 




  Clarification 14 (Site 1) Clarification-860287187243530355
           From  : TEAM12 @ site 1 "TUS2"
         Problem : H
         Elapsed : 625
           State   : ANSWERED by JUDGE5 @ site 1 checked out by JUDGE5 @ site 1
         To ALL? : false
         Question: kak se teglqt 10Mbytes za 24sec s 256kb/s
         Answer  : No response, read problem statement




  Clarification 15 (Site 1) Clarification-7141237642349685631
           From  : TEAM14 @ site 1 "SHU2"
         Problem : G
         Elapsed : 625
           State   : ANSWERED by JUDGE5 @ site 1 checked out by JUDGE5 @ site 1
         To ALL? : false
         Question:      . !
         Answer  :   




  Clarification 16 (Site 1) Clarification--576791697982199723
           From  : TEAM14 @ site 1 "SHU2"
         Problem : G
         Elapsed : 641
           State   : ANSWERED by JUDGE5 @ site 1 checked out by JUDGE5 @ site 1
         To ALL? : false
         Question:  428 - Shu2
         Answer  :  





  Clarification 17 (Site 1) Clarification--2430322355219424670
           From  : TEAM18 @ site 1 "SU1"
         Problem : H
         Elapsed : 680
           State   : ANSWERED by JUDGE5 @ site 1 checked out by JUDGE5 @ site 1
         To ALL? : false
         Question: ,       Kbps,  
    Mb.      ,   
   10 Mb  256 Kbps    40 ?
         Answer  : No comment




  Clarification 18 (Site 1) Clarification--5336861099081002588
           From  : TEAM18 @ site 1 "SU1"
         Problem : G
         Elapsed : 693
           State   : ANSWERED by JUDGE1 @ site 1 checked out by JUDGE1 @ site 1
         To ALL? : false
         Question:   .
         Answer  : No comment





  Clarification 19 (Site 1) Clarification--1631675613421636399
           From  : JUDGE1 @ site 1 "judge1"
         Problem : General
         Elapsed : 860
           State   : ANSWERED by JUDGE5 @ site 1 checked out by JUDGE5 @ site 1
         To ALL? : false
         Question: Attention!!!!! As you could see the time measurement of PC^2 is 
WRONG. After the contest time timing of succesful tasks will be 
recalcullated by the rule:

(time given by PC^2)/10 +20*(numer of wrong submits)
         Answer  : No response, read problem statement




  Clarification 20 (Site 1) Clarification-8234667003301068240
           From  : TEAM6 @ site 1 "IUV1"
         Problem : G
         Elapsed : 861
           State   : ANSWERED by JUDGE1 @ site 1 checked out by JUDGE1 @ site 1
         To ALL? : false
         Question: Kakwo e ogranichenieto za duljinata na stringa?
         Answer  : No comment!




  Clarification 21 (Site 1) Clarification-4134674542599887290
           From  : TEAM11 @ site 1 "TUS1"
         Problem : K
         Elapsed : 879
           State   : ANSWERED by JUDGE3 @ site 1 checked out by JUDGE3 @ site 1
         To ALL? : false
         Question: na tretiq stelaj ima 6 knigi, a na gornite po 5, tova pravilno li e?
         Answer  : Tova ne e vqrna teza!




  Clarification 22 (Site 1) Clarification-1998717665849042650
           From  : TEAM19 @ site 1 "SU2"
         Problem : H
         Elapsed : 884
           State   : ANSWERED by JUDGE1 @ site 1 checked out by JUDGE1 @ site 1
         To ALL? : false
         Question: Clarification- ,    ...
         Answer  :   !!!     !




  Clarification 23 (Site 1) Clarification--1423953048122357625
           From  : TEAM15 @ site 1 "SHU3"
         Problem : H
         Elapsed : 894
           State   : ANSWERED by JUDGE5 @ site 1 checked out by JUDGE5 @ site 1
         To ALL? : false
         Question: moje li 4estotnata lenta da byde 0
         Answer  : No




  Clarification 24 (Site 1) Clarification-5619213386201828165
           From  : TEAM16 @ site 1 "RU1"
         Problem : H
         Elapsed : 1079
           State   : ANSWERED by JUDGE5 @ site 1 checked out by JUDGE5 @ site 1
         To ALL? : false
         Question: weren li e premerniq vhod/izhod ?
ako kanala e 256Kbytes to fail s golemina 10MB 6te se iztegli za 40
sekundi, ako nqma drug potrebitel
         Answer  : Yes




  Clarification 25 (Site 1) Clarification--6242212358351093619
           From  : TEAM1 @ site 1 "BFU1"
         Problem : H
         Elapsed : 1131
           State   : ANSWERED by JUDGE5 @ site 1 checked out by JUDGE5 @ site 1
         To ALL? : false
         Question: Kak e vuzmojno potrebitel 1 da e izteglil fail s golemina 10 MB pri trafik 
256Kb za 24 sek, pri polojenie che dori i da polzva pulniq trafik , toi bi go
izteglil za 40 sek ?
         Answer  : No comment




  Clarification 26 (Site 1) Clarification-2854043124635509155
           From  : TEAM18 @ site 1 "SU1"
         Problem : F
         Elapsed : 1134
           State   : ANSWERED by JUDGE5 @ site 1 checked out by JUDGE5 @ site 1
         To ALL? : false
         Question:    
         Answer  : ok




  Clarification 27 (Site 1) Clarification--5230329990324042110
           From  : TEAM28 @ site 1 "team28"
         Problem : K
         Elapsed : 1226
           State   : ANSWERED by JUDGE5 @ site 1 checked out by JUDGE5 @ site 1
         To ALL? : false
         Question: Osven S i B, N vyvejda li se ot vhoda?
         Answer  : No




  Clarification 28 (Site 1) Clarification-7621891816503254571
           From  : TEAM21 @ site 1 "VFU1"
         Problem : H
         Elapsed : 1426
           State   : ANSWERED by JUDGE5 @ site 1 checked out by JUDGE5 @ site 1
         To ALL? : false
         Question: 1mb = 1000kb ili 1mb = 1024kb ?
         Answer  :  No Comment




  Clarification 29 (Site 1) Clarification-8583110625427547178
           From  : TEAM15 @ site 1 "SHU3"
         Problem : H
         Elapsed : 1456
           State   : ANSWERED by JUDGE5 @ site 1 checked out by JUDGE5 @ site 1
         To ALL? : false
         Question: Moje li razpechatka na zadacha H ?
         Answer  : sled minuta




  Clarification 30 (Site 1) Clarification-574336030030939053
           From  : TEAM15 @ site 1 "SHU3"
         Problem : H
         Elapsed : 1535
           State   : ANSWERED by JUDGE3 @ site 1 checked out by JUDGE3 @ site 1
         To ALL? : false
         Question: #include <iostream>
using namespace std;
int main()
{
	int band,a,b,c,x;
	cin>>band>>a>>b>>c;
	while(cin.good())
	{	if (a==0) cout<<"0"<<endl<<(b*1024/band)<<endl;
		else if (b==0) cout<<a*1024/band<<endl<<"0"<<endl;
			 else if ((band*c)==(b*1024)) 
								{x=a*1024/band;
								cout<<x<<endl;
							    cout<<x+c<<endl;
								}
				  else {
						x=(b*1024-band*c)/(band/2);
						cout<<x-c<<endl;
						cout<<x<<endl;
					 }
				
	 cin>>band>>a>>b>>c;
	}
	return 0;
}
         Answer  : No response, read problem statement




  Clarification 31 (Site 1) Clarification--7580167679750656968
           From  : TEAM1 @ site 1 "BFU1"
         Problem : H
         Elapsed : 1535
           State   : ANSWERED by JUDGE5 @ site 1 checked out by JUDGE5 @ site 1
         To ALL? : false
         Question: Otgoworite na H werni li sa?
         Answer  : Yes




  Clarification 32 (Site 1) Clarification-6474909075390629284
           From  : TEAM1 @ site 1 "BFU1"
         Problem : K
         Elapsed : 1709
           State   : ANSWERED by JUDGE3 @ site 1 checked out by JUDGE3 @ site 1
         To ALL? : true
         Question: Ako ima samo 1 kniga na poslednija red, knigata wednyzh li 
trjabwa da se izwedete, ili dwa pyti, ili da ne se izwezhda reda?
         Answer  : sazdava se ednakav nachalen/kraen indeks




  Clarification 33 (Site 1) Clarification-114816537598471880
           From  : TEAM14 @ site 1 "SHU2"
         Problem : H
         Elapsed : 1778
           State   : ANSWERED by JUDGE3 @ site 1 checked out by JUDGE3 @ site 1
         To ALL? : true
         Question:                   10     -  40 !!!
         Answer  : No comment




  Clarification 34 (Site 1) Clarification--1871479226561679801
           From  : TEAM18 @ site 1 "SU1"
         Problem : I
         Elapsed : 1783
           State   : ANSWERED by JUDGE3 @ site 1 checked out by JUDGE3 @ site 1
         To ALL? : false
         Question:    . 428
         Answer  : Izpratete sorsa si kato vapros




  Clarification 35 (Site 1) Clarification-1394151930759366778
           From  : TEAM18 @ site 1 "SU1"
         Problem : I
         Elapsed : 1817
           State   : ANSWERED by JUDGE3 @ site 1 checked out by JUDGE3 @ site 1
         To ALL? : false
         Question:           .
    .
         Answer  : ...




  Clarification 36 (Site 1) Clarification--9161797329761276277
           From  : TEAM2 @ site 1 "BFU2"
         Problem : D
         Elapsed : 1824
           State   : ANSWERED by JUDGE3 @ site 1 checked out by JUDGE3 @ site 1
         To ALL? : true
         Question:         ?   
... ?
         Answer  : No comments




  Clarification 37 (Site 1) Clarification-8919260854187035388
           From  : TEAM18 @ site 1 "SU1"
         Problem : K
         Elapsed : 1836
           State   : ANSWERED by JUDGE3 @ site 1 checked out by JUDGE3 @ site 1
         To ALL? : true
         Question:       ?
      "1   " ..      .
        ?
         Answer  : No comment




  Clarification 38 (Site 1) Clarification--7046642331764482755
           From  : JUDGE6 @ site 1 "judge6"
         Problem : B
         Elapsed : 2087
           State   : ANSWERED by JUDGE3 @ site 1 checked out by JUDGE3 @ site 1
         To ALL? : false
         Question: Problem B - input example is OK, 
the input starts with the number of tests
and the order of output is: MIN MAX
         Answer  : ...




  Clarification 39 (Site 1) Clarification-3598231191301342326
           From  : TEAM4 @ site 1 "TUG"
         Problem : H
         Elapsed : 2087
           State   : ANSWERED by JUDGE5 @ site 1 checked out by JUDGE5 @ site 1
         To ALL? : false
         Question: Ako vremeto e 23,1 izhoda 6te e 23 ili 24?
         Answer  : No Comment




  Clarification 40 (Site 1) Clarification--6050271373571207523
           From  : TEAM19 @ site 1 "SU2"
         Problem : General
         Elapsed : 2098
           State   : ANSWERED by JUDGE5 @ site 1 checked out by JUDGE5 @ site 1
         To ALL? : false
         Question:        ?
         Answer  : .    Clarification     .




  Clarification 41 (Site 1) Clarification-6493814588991548685
           From  : TEAM19 @ site 1 "SU2"
         Problem : D
         Elapsed : 2167
           State   : ANSWERED by JUDGE3 @ site 1 checked out by JUDGE3 @ site 1
         To ALL? : false
         Question: Print:

#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

struct factor {
	int f;
	long long cnt;
	factor(int f, long long cnt) : f(f), cnt(cnt) {}
};

bool operator< (const factor &a, const factor &b) {
	return a.f < b.f;
}

vector<factor> factorize(int num) {
	vector<factor> res;
	for (int i = 2; i * i <= num; ++i) {
		if (num % i == 0) {
			int cnt = 0;
			while (num % i == 0) {
				++cnt;
				num /= i;
			}
			res.push_back(factor(i, cnt));
		}
	}
	if (num != 1) {
		res.push_back(factor(num, 1));
	}
	return res;
}

long long MAX_ANS = 1e9;

long long pow(long long a, long long n) {
	if (a == -1) {
		return -1;
	}
	long long res = 1;
	long long cur = a;
	for (long long i = 0; (1LL << i) <= n; ++i) {
		if (n & (1LL << i)) {
			if (cur == -1) {
				return -1;
			}
			res *= cur;
			if (res > MAX_ANS) {
				return -1;
			}
		}
		if (cur != -1) {
			cur *= cur;
			if (cur > MAX_ANS) {
				cur = -1;
			}
		}
	}
	return res;
}

int main() {
	int T;
	cin >> T;
	for (int t = 0; t < T; ++t) {
		int A, N;
		cin >> A >> N;
		vector<factor> as = factorize(A);
		vector<factor> ns = factorize(N);
		bool ok = true;
		for (int i = 0; i < ns.size(); ++i) {
			if (!binary_search(as.begin(), as.end(), ns[i])) {
				ok = false;
			}
		}
		if (!ok) {
			printf("0\n");
			continue;
		}
		long long last = A;
		vector<factor> v = as;
		for (int ans = 1;; ++ans) {
			//for (int i = 0; i < v.size(); ++i) {
			//	cout << v[i].f << " " << v[i].cnt << "\n";
			//}
			//cout << last << " last\n";
			bool ok = true;
			for (int i = 0; i < ns.size(); ++i) {
				vector<factor>::iterator it = lower_bound(v.begin(), v.end(), ns[i]);
				if (it->cnt != -1 && it->cnt < ns[i].cnt) {
					ok = false;
					break;
				}
			}
			if (ok) {
				printf("%d\n", ans);
				break;
			}
			last = pow(A, last);
			for (int i = 0; i < v.size(); ++i) {
				if (v[i].cnt == -1 || last == -1) {
					v[i].cnt = -1;
					continue;
				}
				v[i].cnt *= last;
				if (v[i].cnt > MAX_ANS) {
					v[i].cnt = -1;
				}
			}
		}
	}
}
         Answer  : ...




  Clarification 42 (Site 1) Clarification--7191065688533859555
           From  : TEAM9 @ site 1 "NBU1"
         Problem : E
         Elapsed : 2189
           State   : ANSWERED by JUDGE5 @ site 1 checked out by JUDGE5 @ site 1
         To ALL? : false
         Question: Moje li da doidete da si razpe4atame kod?
         Answer  :  -




  Clarification 43 (Site 1) Clarification-7651296853046930774
           From  : TEAM22 @ site 1 "VFU2"
         Problem : H
         Elapsed : 2207
           State   : ANSWERED by JUDGE5 @ site 1 checked out by JUDGE5 @ site 1
         To ALL? : false
         Question: Pri polojenie 4e 10mbytes pri vuvedenata skorost 256kbytes 6te se iztegli za 10mbytes/256kbytes=40 sekundi nqma li gre6ka v primerniq izhod?
         Answer  : No comment!




  Clarification 44 (Site 1) Clarification--8089639960339935083
           From  : TEAM9 @ site 1 "NBU1"
         Problem : E
         Elapsed : 2222
           State   : ANSWERED by JUDGE3 @ site 1 checked out by JUDGE3 @ site 1
         To ALL? : false
         Question: #include <iostream>
#include <algorithm>

#define MAXN 10100
#define MAXR 1000000100
//#define MAXR 1000

using namespace std;

int a[MAXN];
int k, n;

bool isTrue(int t)
{
    int b = a[0];
    int br = 1, i = 1;
    while (i < n)
    {
       while (a[i] < b + t)
        {
            i++;
            if (i >= n)
            {
                break;
            }
        }
        if (a[i] >= b + t)
        {
            br++;
        }
        if (br >= k)
        {
            break;
        }
        b = a[i];
    }
    return br >= k;
}

int solve()
{
    int lo = 0, hi = MAXR, mid;
    int res = 0;
    while (lo <= hi)
    {
        mid = (hi + lo) / 2;
        if (isTrue(mid))
        {
            lo = mid + 1;
            if (res < mid)
            {
                res = mid;
            }
        }
        else
        {
            hi = mid - 1;
        }
    }
    return res;
}

int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        cin >> n >> k;
        for (int i = 0; i < n; i++)
        {
            cin >> a[i];
        }
        sort(a, a + n);
        cout << solve() << endl;
    }
    return 0;
}
         Answer  : ...




  Clarification 45 (Site 1) Clarification--3470320928284529723
           From  : TEAM3 @ site 1 "BFU3"
         Problem : G
         Elapsed : 2314
           State   : ANSWERED by JUDGE3 @ site 1 checked out by JUDGE3 @ site 1
         To ALL? : false
         Question:    ' abcdefa'
   : 
'abcdcba afcdcfa abedeba  afedefa'
         Answer  : no comment




  Clarification 46 (Site 1) Clarification-6274858251847328921
           From  : TEAM11 @ site 1 "TUS1"
         Problem : G
         Elapsed : 2412
           State   : ANSWERED by JUDGE3 @ site 1 checked out by JUDGE3 @ site 1
         To ALL? : false
         Question: ab  i abc  polusimetri4ni li sa ?
         Answer  : No comment




  Clarification 47 (Site 1) Clarification-5610485092185707587
           From  : TEAM9 @ site 1 "NBU1"
         Problem : B
         Elapsed : 2464
           State   : ANSWERED by JUDGE3 @ site 1 checked out by JUDGE3 @ site 1
         To ALL? : false
         Question: #include <cstdio>
#include <algorithm>
#include "memory.h"
#define MAXN 129000
#define MAXP 17
#define INF 0x77777777
using namespace std;

int lgN, N;

struct ans
{
    int min, max, cMin, cMax;
    ans() { ans(0, 0, 0, 0); }
    ans(int min, int cMin, int max, int cMax)
        :min(min), cMin(cMin), max(max), cMax(cMax) { }
};

ans T[MAXN][MAXP];
int A[MAXN];

ans combine(const ans& a, const ans& b)
{
    ans r;
    r.max = max(a.max, b.max);
    if(a.max == b.max) r.cMax = a.cMax + b.cMax;
    else r.cMax = ((a.max > b.max) ? a.cMax : b.cMax);

    r.min = min(a.min, b.min);
    if(a.min == b.min) r.cMin = a.cMin + b.cMin;
    else r.cMin = ((a.min > b.min) ? a.cMin : b.cMin);
}

void init()
{
    memset(T, 0, sizeof(T));
    for(int x = 0; x < N; x++)
        T[x][0] = ans(A[x], 1, A[x], 1);

    for(int y = 1; y <= lgN; y++)
        for(int x = 0; x < N; x++)
            T[x][y] = combine(T[x][y - 1], T[x + (1 << (y - 1))][y - 1]);
}

void set(int p, int v)
{
    A[p] = v;
    T[p][0] = ans(v, 1, v, 1);
    for(int y = 1; y <= lgN; y++)
    {
        int xx = p - (p & ((1 << y) - 1));
        T[xx][y] = combine(T[xx][y - 1], T[xx + (1 << (y - 1))][y - 1]);
    }

}

ans get(int l, int r)
{
    ans res = ans(INF, 0, -INF, 0);
    int h = 0;
    r++;
    while(l + (1 << h) <= r)
    {
        while((l & ((1 << (h + 1)) - 1)) == 0 && l + (1 << (h + 1)) <= r)
        {
            h++;
        }
        res = combine(res, T[l][h]);
        l += (1 << h);
    }

    while(l < r)
    {
        while(l + (1 << h) > r)
        {
            h--;
        }
        res = combine(res, T[l][h]);
        l += (1 << h);
    }
    return res;
}

void read()
{
    int ax;
    scanf("%d%d", &ax, &N);
    int cN = N;
    lgN = 0;
    while(cN >>= 1) ++lgN;
    for(int i = 0; i < N; i++)
    {
        scanf("%d", &A[i]);
    }
    init();
}

void solve()
{
    int l, r, op, val, pos;
    ans answer;
    while(scanf("%d", &op) == 1)
    {
        switch(op)
        {
            case 1:
                scanf("%d%d", &val, &pos);
                set(pos - 1, val);
                break;
            case 2:
                scanf("%d%d", &l, &r);
                answer = get(l - 1, r -1);
                printf("%d %d %d %d\n", answer.min, answer.cMin, answer.max, answer.cMax);
                break;
            case 3:
                return;
        }
    }
}

int main()
{
    int nT;
    scanf("%d", &nT);
    while(nT--)
    {
        read();
        solve();
    }
    return 0;
}
         Answer  : ....




  Clarification 48 (Site 1) Clarification-53768922696751807
           From  : TEAM2 @ site 1 "BFU2"
         Problem : D
         Elapsed : 2795
           State   : ANSWERED by JUDGE5 @ site 1 checked out by JUDGE5 @ site 1
         To ALL? : false
         Question:  ,  ,  ,   Judge-a     .
         Answer  : No response, read problem statement




  Clarification 49 (Site 1) Clarification--7431675667964457112
           From  : TEAM10 @ site 1 "NBU2"
         Problem : F
         Elapsed : 2992
           State   : NEW
         To ALL? : false
         Question: Molq printiraite F
         Answer  : null




  Clarification 50 (Site 1) Clarification-3118077735734022040
           From  : TEAM10 @ site 1 "NBU2"
         Problem : A
         Elapsed : 2994
           State   : NEW
         To ALL? : false
         Question: Molq printiraite A
         Answer  : null




end report
