int main(void)
{
int t,n,count,c;
t=scan_d();
while(t--)
{
count=0;
n=scan_d();
c=5;
while((n/c)>0)
{
count+=(n/c);
c=c*5;
}
printf("%d\n",count);
}
return 0;
}
int main(void) {
int t,a,b;
setPrime();
t=scan_d();
while(t--)
{
int count=0;
a=scan_d();
b=scan_d();
while(a<=b)
{
if(arr[a]==0)
count++;
a++;
}
printf("%d\n",count);
}
return 0;
}
int main() {
int t,n,k,count,val,i;
long int a[101];
t = scan_d();
while(t--) {
count=0;
n = scan_d();
for(i=0;i<n;i++) a[i] = scan_ld();
k = scan_d();
val=a[k-1];
for(i=0;i<n;i++) {
if(a[i]<val) count++;
}
count++;
print_d(count);
}
return 0;
}
int main(){
int T ; scan_d(T) ;
for(int _t = 0 ; _t < T ; _t ++){
int N ; scan_d(N);
std::set<int> srt ;
std::set<int>::iterator it;
for(int i = 0 ; i < N ; i ++){
int op ; scan_d(op) ;
if(op == 1){
int t ; scan_d(t) ;
srt.insert(t) ;
}else{
it = srt.begin();
int oo = * it ;
out(oo);
puts("");
srt.erase(it);
}
}
}
}
int main(void) {
int n;
n=scan_d();
printf("%d",getMinSteps(n));
return 0;
}
