vj1131 最小公倍数和最å¤&se

Vj1131 - var x,y,ans:longint ans=2^k k procedure main var i,t:longint begin readln(x,y if y mod x<>0 then begin writeln(0 exit end t:=y div x

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
//±ÉÈ˵ķ½·¨ //ÊýÂÛ //Ëã³ö×îС¹«±¶ÊýÓë×î´ó¹«Ô¼ÊýµÄÉÌ ans=2^k kΪÕâ¸öÉ̵ÄÖÊÒò×Ó¸öÊý / //¶à³ö¼¸×éÊý¾Ý / var x,y,ans:longint; procedure main; var i,t:longint; begin readln(x,y); if y mod x<>0 then begin writeln(0); exit; end;
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/21/2011 for the course CS 001 taught by Professor 001 during the Spring '11 term at Shandong University.

Ask a homework question - tutors are online