Rank Tên đăng nhập Điểm Bài tập ▾ Giới thiệu
20201 201 1
20202 20 1
20203 80 1
20203 80 1
20205 101 1
20206 301 1
20207
Tr4i_Dep_Nam_Ky
Võ Văn Quốc Trung
401 1
20208 160 1
20209 301 1
20210 40 1
20211 301 1
20212 801 1
20213 401 1
20214 101 1

Tao học lớp tin

20215 30 1
20216 101 1
20217
NamTranVN2719
TRANNGUYENNHUTNAM
1801 1
20218 50 1
20219 301 1
20220 201 1

ok

20221 70 1
20222 1601 1
20223 1801 1
20224 1601 1
20225 901 1
20226 301 1
20227 86 1
20228 101 1

20228 101 1
20228 101 1
20231 201 1
20232 1440 1
20233 201 1
20234
tranxuantien5h
trần xuân tiến
101 1
20234 101 1
20236 51 1
20237 901 1
20238 45 1
20239 901 1
20240 180 1
20241 856 1
20242 201 1

no

20243 45 1
20244 801 1
20245 301 1

This is Souta!

20246 100 1
20246 101 1

include <iostream>

using namespace std;
int main()
{ int n,m;
cin>>n>>m;
while (n!=m)
{ if (n>m) n=n-m
else m=m-n;}
cout<<m;
return 0;
}

20248 301 1
20249 101 1
20250 162 1
20251 101 1
20252 6 1
20253 200 1
20253 201 1
20255 20 1
20256 100 1
20256 101 1
20258 140 1

Hoc gioi!

20259 1501 1
20259 1501 1
20259 1501 1
20259 1501 1
20259 1501 1
20264 201 1
20264 201 1
20264 201 1
20264 201 1
20264 201 1
20264 201 1
20264 201 1
20264 201 1
20264 201 1
20273 120 1
20274 1001 1
20275 800 1
20276 1701 1
20277 768 1
20278 727 1
20279 30 1
20280 401 1

a[0]=-999999999; a[n+1]=99999999;
k=1; d[1]=1;
for (int i=2; i<=n+1; i++) {
if (a[i]<a[d[1]]) {d[1]=i;} else if (a[i]>a[d[k]]) {k++;d[k]=i;} else {
d=1; c=k;
int vt=0;
while(d<=c){
int g=(d+c)/2;
if (a[i]>a[d[g]]) {vt=g;d=g+1;} else c=g-1;
}
}
d[vt]=i;
}
return k;

20281 101 1
20282 301 1
20283 401 1
20284 101 1
20285 301 1
20286 101 1
20287 301 1
20288 201 1
20289 1292 1
20290 1501 1
20291 1350 1
20292 301 1
20293 270 1
20294 1601 1
20295 1125 1
20296 301 1
20297 400 1
20298 1001 1
20299 1350 1
20300 201 1