Created
February 6, 2017 16:09
-
-
Save anonymous/a505a57fe24ef39be2ddabf49f104fda to your computer and use it in GitHub Desktop.
NOIP2014 JS-381 code
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# inciude" studio.h" | |
main() | |
{ | |
printf(for,i>=1,/n); | |
for(%n,%m,%k,/); | |
printf(for,x,x++;y,y--;/); | |
studio(for"n,m,k,x,y";/n,m,k,x,y/); | |
printf("0<=x<m;0<=y<m;y<x); | |
} | |
{ | |
for(studio,"n,m,k";/n,m,k;); | |
for("0<=x<=n-1;0<=y<=n-i;x>y,"); | |
for("P L H ";"P>x,l>y:P<L<H,;/"); | |
} | |
{ | |
printf(for,studio,x,y,m,n,l,h;/); | |
for(:"0<x<10,0<y<10,0<L<10,0<h<10;") | |
studio(:"%x%y%L%m%n,x*y,m*n<:"); | |
} | |
{ | |
{printf(for studio,:x,y,m,n,L:"); | |
for(printf;"L,m,x,n,H;") | |
} | |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# incidue oide.n | |
main() | |
{ | |
printf(:"%n%m/,nnuieuuf,nitudjhg); | |
for(:"/n.); | |
printf(:'0<n<=2,m<=100:"); | |
prinf(:"0<n<=100,m<=100); | |
for(:"0<m<=100,m<=10000); | |
printf(for /n.): | |
} | |
{ | |
printf(0<n<=100,m<=1000000); | |
for(nurkysd./:'hdk%:/nufnuiw*&); | |
printf(mir,;dufnui";%njugbu); | |
for(0<=n<=2;0<n<=100,m<=100;); | |
} | |
{ printf(nirbyg,uebyu:'nudnehui%nuf:'/m.nuitb); | |
for(:"n%m%an%ai%;:"/muernyw) | |
printf(mirnushuw,nifrnus.nuebguanm,kdidnrbu); | |
for(0<=100,m<=1000000;0<n<=100m,m<=10000;0<n<=100,m<=100;0<n<=2,m<=100); | |
printf(nuignud,bniuw%klm&mdebuemz./:"[mitnu}iufu%); | |
for(mirn.%[nfiuiern,nuwby%mfnum};0<n<=10); | |
printf(nirnuhg,nuggbvy[n];[m];nuebnyu); | |
} | |
{ pejkhu,nmuerny,[nuitrbny,%bnuerbn;]bnur/;"); | |
for(:"/.n); | |
printf(0<n<=2.m<=100); | |
for(0<n<=100,m<=100); | |
printf(0<m<=100,m<=10000); | |
for(0<n<=100,m<=1000000); | |
} | |
{ | |
printf(nuiernui[nuirnu%:"miohenh); | |
for(nurnu;nuigernu[niuurby],inbnu); | |
printf(nirnu[mifby]:"nirnu); | |
for(niro[nitrbyu]nirnu%:"/mnurbu/); | |
} | |
{ printf(0<n<=2,m<=100;); | |
for(0<n<=100,m<=100;); | |
printf(0<m<=100,m<=10000); | |
for(0<m<=100,m<=1000000); | |
} |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# inciude" stdio.h" | |
main() | |
{ | |
(int,n,n-1,n<=n-1); | |
printf(for,u,v,u-v/n); | |
(for,uv=30%;1<n<100); | |
(for,uv=60%;1<n<2000); | |
(for,uv=100%;1<n<=200000,0<Wi<=10000) | |
} | |
{ | |
(1,3);(2,4);(3,1);(3,5);(4,2);(5,3); | |
printf(for,2+15+20+15+20=74;) | |
printf(for,n,i,Wi;/); | |
} | |
{ | |
for(u,v,n/,2+1,); | |
printf(stdino.h,n,v,1<n<100); | |
printf(inciude,h,v,n): | |
for(int,i<=1000,"); | |
for(int,uv<=10000); | |
} |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# incidue oide.n | |
main() | |
{ | |
printf(dhueiis, iydn8fi iiudeha); | |
for(forift;"x,y,n,m,) | |
printf(:"s,y); | |
for(:";0<n<=10,0<m<=20); | |
for(;"; /.n) | |
printf(0<n<=100,0<m<=2000;); | |
for(:"/n) | |
} | |
{printf(0<=n<=10000;0<=m<=200000/); | |
for(:"/m) | |
printf(0<n<=10000;0<m<=200000);(0<x,y,s,t<=n); | |
} | |
{ | |
printy surnusk(1->3->4->5;/.n); | |
for printfh(:"/n.jhuel,jhhogk); | |
printf( for :"/n.com formhgnuse); | |
for(:"/n.sterys ; for,desytf); | |
} | |
{ (desyaz,printf,for;"0<n<=10,0<m<=20;); | |
for(0<n<100,0<m<=2000;0<n<=10000;0<m<=00000,0<x,y,s,t<=n); | |
frintf(:;1->3->4->5); | |
} | |
{ | |
printf (for ,:"/n.x.y.--syrniifg"); | |
for( printf 0<n<=10,0<m<=20); | |
strintf(:"0<n<=100,0<m<=2000); | |
for(:"0<n<=1000;0<m<=200000;0<x,y,s,<=n); | |
} | |
{ printf (for;0<n<=10000;0>m<=200000;0,x,y,s,t<=n); | |
for(niohegnuid./mhj,iguid); | |
{ dirnoi(0<n<=10,0<m<=200; | |
for(diroig/.mnju;0<n<=100;0<m<=2000); | |
} | |
} |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#inciude"stdio.h" | |
main() | |
{int.printf[N],[NA],[NB],[NC];/ | |
inciude (%d,%d,/); | |
pintf(A=0,0<=1;); | |
} | |
{.0<N.200.0< NA.200.0<NB.200. | |
inciude (&1,&2,&3,&4)} | |
{ | |
pirntf(N=1,1++) | |
inciude(stdio"&4*5:,) | |
main(stdio,i<=1,i++); | |
(stdio,n<=9,n++); | |
(int ,i<=1,i++;j<=9,j++);} | |
{ | |
printf(%N,%NA,%NB;/); | |
stdio.h. | |
stdion(N,NA,NB,B;N<=B) | |
stdion(N,NB,NA,A,A<=N) | |
} | |
{ | |
printf(int . N<=1,NA<=10;/) | |
} |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# incidue oide.n | |
main() | |
{ printf("d>=0;d,n,x,yk;"); | |
for(:"%d,n,k,x,y;"%d;%n;%k;%x;%y;); | |
} | |
{ printf(for,stoide;":*&); | |
for(printf ; x y k;dieojft,dhiiro); | |
(\:"dirooucua.shueoui,x,y,z,); | |
printf(for:"1<=d<=0,1<=n<=20:"/.n); | |
{ for./.0<=x<=128,0<=y<=128); | |
for(:"0<=k<=1000,000:"); | |
} | |
printf(kieouc,jfiiu,&x,y,n,k,d;); | |
stoic(:"printf 1<=d<=20); | |
stoic(:"printf 1<=n<=20); | |
} | |
{ printf(0<=x<=128;0<=y<=128); | |
stoic(:"0<k<=1000,000); | |
} | |
{ | |
stoic(printf /.x%y%n%d%:"/n.int); | |
for(printf x,y,n,d,k); | |
printf(1<=d<=20;1<=n<=20;0<=x<=128;0<=y<=128;o<k<=1000,000); | |
} | |
{ | |
(for,printf,stoic;x,y,n,d,k;); | |
printf(:"&x;y;z;n;d;k;%") | |
for(dicodr,mien,decrit,) | |
printf(:"cidelr,birjufr,syirohyn) | |
stoic(:"[0]*[128];[0]*[1000000]); | |
(for ; storif ) | |
} | |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment