Tên đăng nhập Điểm Bài tập ▾ Giới thiệu
19601 1501 1
19602 214 1
19603 201 1
19604 101 1
19604 101 1
19606 351 1
19607 35 1
19608 101 1
19608 101 1
19608 101 1
19608 101 1
19608 101 1
19608 101 1
19608 101 1
19608 101 1
19608 101 1
19608 101 1
19608 101 1

include <bits/stdc++.h>

using namespace std;
int a;
int main ()
{
cin>>a;
cout<<a*2;
}

19619 67 1

for i in range(int(input())):
n,k = [int(i) for i in input().split()]
dem = 0
for i in range(1,n*k):
if i % n != 0:
dem += 1
if dem == k :
print(i)
break

19620 201 1
19621 301 1

include<bits/stdc++.h>

using namespace std;
long n;
long long a[1000001];
int main(){

cin>>n;
long long x,y,j1,j2,res;
for(int i=0;i<n;i++)
    cin>>a[i];
    x=*max_element(a,a+n);
    y=*min_element(a,a+n);
  j1=1e9;
  j2=-1e9;
  res=1e9;
  for(int i=0;i<n;i++){
    if(a[i]==x)j1=i;
    if(a[i]==y)j2=i;
    res=min(res,abs(j1-j2)+1);

  }
  cout<<res;

}

19622 1001 1
19623 201 1
19624 801 1
19624 801 1
19626 1601 1
19627 101 1
19628 801 1
19629 201 1
19630
leo17112005
phanphucthinh
301 1
19631 1501 1
19632
nguyentrong17
Nguyễn Đình Minh Trọng
301 1
19633
tran12
Nguyễn Hoàng Bảo Trân 10 tin
985 1
19634 801 1
19635 540 1
19636 901 1
19637 101 1
19637 101 1
19639 1 1
19640 285 1
19641 1201 1
19642 301 1
19643 401 1
19643 401 1
19645 55 1
19646 101 1
19646 101 1
19648 500 1
19649 1 1
19650 201 1
19651 301 1

xâu con

19652 101 1
19653 201 1
19654 301 1
19654 301 1
19654 301 1
19657 901 1
19658 727 1
19659 195 1
19660 1801 1
19661 1501 1
19661 1501 1
19663 101 1
19664 243 1
19665 201 1
19666 270 1
19667 901 1
19668 2001 1
19669 1801 1
19670 1401 1
19671 401 1
19672 101 1
19672 101 1
19674 40 1
19675 1301 1
19676 101 1
19676 101 1
19676 101 1
19676 101 1
19680 64 1
19681 101 1
19682 64 1
19683 101 1
19684 15 1
19685 1501 1
19686 257 1
19687 250 1
19688 501 1
19689 200 1
19690 101 1
19691 160 1
19692 101 1
19693 301 1
19694 501 1
19695 1401 1
19696 1301 1
19697 801 1
19698 281 1
19699 139 1
19700 101 1