锘??xml version="1.0" encoding="utf-8" standalone="yes"?>久久99国产精一区二区三区,欧美伊人久久大香线蕉综合69,久久精品国产亚洲AV麻豆网站http://www.shnenglu.com/hoolee/category/19304.htmlIf you believe, you can!zh-cnTue, 28 Aug 2012 19:06:11 GMTTue, 28 Aug 2012 19:06:11 GMT60hdu2424澶ф暟綆楀紡榪愮畻http://www.shnenglu.com/hoolee/archive/2012/08/28/188557.html灝忛紶鏍?/dc:creator>灝忛紶鏍?/author>Tue, 28 Aug 2012 13:50:00 GMThttp://www.shnenglu.com/hoolee/archive/2012/08/28/188557.htmlhttp://www.shnenglu.com/hoolee/comments/188557.htmlhttp://www.shnenglu.com/hoolee/archive/2012/08/28/188557.html#Feedback0http://www.shnenglu.com/hoolee/comments/commentRss/188557.htmlhttp://www.shnenglu.com/hoolee/services/trackbacks/188557.html琛ㄨ揪寮忔眰鍊鹼紝鐗墊秹鍒板ぇ鏁般傜敤Java鍐欑殑錛屾敹鑾蜂笉灝戯紝鑶滄嫓鍏夎緣鍟妦~
import java.math.*; import java.util.*; publicclass Main { publicstaticvoid main(String[] s) { int count =1; int i, j; String[] str =new String[30]; int hsrs; Scanner sc =new Scanner(System.in); while(sc.hasNext()) { hsrs =1; int N = sc.nextInt(); for(i =0; i < N; i++) str[i] = (String)sc.next(); for(i =1; i < N; i +=2) if(!str[i].equals("+") &&!str[i].equals("*")) hsrs =0; for(i =0; i < N; i +=2) if(str[i].equals("+") || str[i].equals("*")) hsrs =0; if(N %2==0) hsrs =0; BigInteger left = BigInteger.ZERO; BigInteger right = BigInteger.ZERO; if(hsrs ==1) { right =new BigInteger(str[0]); String op ="+"; for(i =1; i < N; i +=2) { if(str[i].equals("+")) { left = left.add(right); right =new BigInteger(str[i +1]); op ="+"; } else right = right.multiply(new BigInteger(str[i +1])); } } left = left.add(right); System.out.print("Case "+ count+++": "); if(hsrs ==1) System.out.println(left); else System.out.println("Invalid Expression!"); } } }
]]>poj2389--澶ф暟涔樻硶C鍜孞ava瀹炵幇http://www.shnenglu.com/hoolee/archive/2012/08/12/186965.html灝忛紶鏍?/dc:creator>灝忛紶鏍?/author>Sun, 12 Aug 2012 03:16:00 GMThttp://www.shnenglu.com/hoolee/archive/2012/08/12/186965.htmlhttp://www.shnenglu.com/hoolee/comments/186965.htmlhttp://www.shnenglu.com/hoolee/archive/2012/08/12/186965.html#Feedback0http://www.shnenglu.com/hoolee/comments/commentRss/186965.htmlhttp://www.shnenglu.com/hoolee/services/trackbacks/186965.html澶ф暣鏁扮殑涔樻硶銆傚亣璁炬眰a*b錛屽仛娉曟槸灝哹鐨勬瘡涓浣嶄笌a鐩鎬箻鍚庡啀姹傚拰錛屾敞鎰廱鐨勪笉鍚屼綅鏉冨兼槸涓嶄竴鏍風(fēng)殑銆?br />浠ヤ笅鏄湰棰樹唬鐮侊細(xì)
#include<stdio.h> #include<stdlib.h> #include<string.h> #define LEN 100 void Out(char*s) { for(int i =0; i <10; i++) printf("%d", s[i]); putchar(10); } void Add(char*num1, char*num2) { int i, j; for(i =0; i < LEN; i++) num1[i] += num2[i]; int t =0; int t2; for(i =0; i < LEN; i++) { t2 = num1[i] + t; t = t2 /10; num1[i] = t2 %10; } } void Multi(char*num1, int n, int w) {//num1涓巒鐩鎬箻錛宯鐨勬潈閲嶄負(fù)10^(w-1) int i, j; char c; int len = LEN; while(num1[--len] ==0&& len >0); for(i = len; i >=0; i--)//move num1[w -1+ i] = num1[i]; for(i =0; i < w -1; i++) num1[i] =0; for(i =0; i < LEN; i++)//multiply num1[i] *= n; int t =0; int t2; for(i =0; i < LEN; i++)//carry bit { t2 = num1[i] + t; t = t2 /10; num1[i] = t2 %10; }
} void Reverse(char*s) { int len = strlen(s); for(int i =0; i < len /2; i++) { char c = s[i]; s[i] = s[len -1- i]; s[len -1- i] = c; } } void ToNum(char*s) { int len = strlen(s); for(int i =0; i < len; i++) s[i] -='0'; } void Copy(char*t, char*f) { for(int i =0; i < LEN; i++) t[i] = f[i]; } char A[LEN];//鏈緇堢粨鏋?/span> char B[LEN];//涔樻暟 char C[LEN];//涔樻暟 char D[LEN]; /* *鑾峰彇C[]鐨勬瘡涓浣嶄笌B[]鐩鎬箻錛岀粨鏋滃瓨鍦―[]涓紝 *騫朵笉鏂皢D[]鍔犲埌A[]涓婏紝鏈鍚嶢[]涓瓨鐨勫氨鏄粨鏋?br />*/ int main() { int i, j; gets(B); gets(C); int lenc = strlen(C); Reverse(B); Reverse(C); ToNum(B); ToNum(C); int w =1; for(i =0; i < lenc; i++) { Copy(D, B); Multi(D, C[i], i +1); Add(A, D); } i = LEN; while(A[--i] ==0&& i >0); for(; i >=0; i--) printf("%d", A[i]); putchar(10); //system("pause"); }
]]>poj2602--澶ф暟鍔犳硶http://www.shnenglu.com/hoolee/archive/2012/08/11/186902.html灝忛紶鏍?/dc:creator>灝忛紶鏍?/author>Sat, 11 Aug 2012 07:33:00 GMThttp://www.shnenglu.com/hoolee/archive/2012/08/11/186902.htmlhttp://www.shnenglu.com/hoolee/comments/186902.htmlhttp://www.shnenglu.com/hoolee/archive/2012/08/11/186902.html#Feedback0http://www.shnenglu.com/hoolee/comments/commentRss/186902.htmlhttp://www.shnenglu.com/hoolee/services/trackbacks/186902.html涓閬撶畝綆鍗曞崟鐨勫ぇ鏁板姞娉曢錛屾椂闂寸珶鐒跺崱鍦╣etchar()鍜宲utchar()涓婏紝鎴戠敤scanf()鍜宲rintf()紜槸瓚呮椂浜嗭紝瓚呮椂浜嗗晩浜詫紝榪欎箞鍧戠埞鐨勬湁鏈ㄦ湁鍟婏紝鏈夋湪鏈夛紒錛?br />2602 Accepted 1136K 1938MS C++ 702B 浠ヤ笅鏄湰棰樹唬鐮侊細(xì)
#include<stdio.h> #include<stdlib.h> #include<string.h> #define LEN 1000010 char num1[LEN]; int N; int main() { int i, j; char a, b; scanf("%d", &N); int count = N -1; getchar(); for(i =0; i < N; i++) { a = getchar(); getchar(); b = getchar(); getchar(); num1[count] = a -'0'+ b -'0'; count--; } int t =0; int t2; for(i =0; i < N +2; i++)//carry bit { t2 = num1[i] + t; num1[i] = t2 %10; t = t2 /10; } for(i = N -1; i >=0; i--)//out putchar(num1[i] +'0'); putchar(10); //system("pause"); }
#include<stdio.h> #include<stdlib.h>//zoj3167 #define LEN 310 void Add(int*A, int*B)//A[]=A[]+B[] { int i, j; for(i =0; i < LEN; i++) { A[i] += B[i]; } int t =0; for(i =0; i < LEN; i++) { int t1 = (A[i] + t) /10; A[i] = (A[i] + t) %10; t = t1; } } void MultiOne(int*B, int i, int w)//B[]*(i*10^(w-1)) { int j, k; for(j = LEN -1; j >= w -1; j--) B[j] = B[j - w +1]; for(k =0; k < w -1; k++) B[k] =0; for(j =0; j < LEN; j++) B[j] *= i;
int t =0; for(i =0; i < LEN; i++) { int t1 = (B[i] + t) /10; B[i] = (B[i] + t) %10; t = t1; } } void Set0(int*A) { for(int i =0; i < LEN; i++) A[i] =0; } void Copy(int*F, int*T) { int i; for(i =0; i < LEN; i++) T[i] = F[i]; } int main() { int i, j; int K, M; int A[LEN];//瀛樺偍M^t錛岃繖鏄綋鍓嶄箻鏂硅綆楃殑緇撴灉 int B[LEN];//B[]鍜孋[]涓璧峰畬鎴愬M^(t+1)鐨勮綆楋紝B[]瀛樺偍M^t涓巄鐨勬煇涓浣峣鐩鎬箻鐨勭粨鏋滐紝 int C[LEN];//C[]鐢ㄦ潵瀛樺偍璁$畻鍒癰鐨勫綋鍓嶄綅鏃剁殑绱姞緇撴灉 while(scanf("%d%d", &K, &M) != EOF) { int n =1; Set0(A); Set0(B); Set0(C); int t = M; for(i =0; t >0; i++)//init A as M^1 { A[i] = t %10; t /=10; } while(A[K -1] !=7) { Set0(C); int t = M; int w =1; while(t >0) { Copy(A, B); int ii = t %10; MultiOne(B, ii, w); Add(C, B);//姣忎竴嬈$畻瀹孊[]錛岀瘡鍔犲埌C[]涓?/span> w++; t /=10; } Copy(C, A); n++; } printf("%d\n", n); } //system("pause"); }