Tag: poj
-
poj_1009(TLE&MLE)
/* //ACM Poj 1009 //File: 1009.cpp //Author: Kangzj //Mail: Kangzj@mail.bnu.edu.cn //Date: April 29, 2009 */
-
poj_1008
//ACM Poj 1008 //File: 1008.cpp //Author: Kangzj //Mail: Kangzj@mail.bnu.edu.cn //Date: April 29, 2009
-
poj_1007
/* //ACM Poj 1007 //File: 1007.cpp //Author: Kangzj //Mail: Kangzj@mail.bnu.edu.cn //Date: April 28, 2009 */
-
poj_1005
/* //ACM Poj 1005 //File: 1005.cpp //Author: Kangzj //Mail: Kangzj@mail.bnu.edu.cn //Date: April 28, 2009 */
-
poj_2000
//ACM Poj 2000 //File: 2000.cpp //Author: Kangzj //Mail: Kangzj@mail.bnu.edu.cn //Date: April 24, 2009
-
poj_1006
Problem: http://poj.grids.cn/problem?id=1006 Solution: #include #include #include using namespace std; int main() { int p, e, i, n=0; long cp, ce, ci; short d; int j=1;//计数用 ostringstream buf; while(1) { cin>>p>>e>>i>>d; if(p==-1 && e==-1 && i==-1 && d==-1) { break; } n=d; while(1) { n++; if((n-p)%23==0 && (n-e)%28==0 && (n-i)%33==0) { n-=d; if(n==0) { n=d; […]
-
poj_1004
#include using namespace std; int main() { int i; float all=0, temp=0; for(i=0;i<12;i++) { cin>>temp; all+=temp; } all+=0.005; cout.precision(2); //cout.setf(ios_base::showpoint); cout<