Rick's blog

UVA 102 :  https://uva.onlinejudge.org/external/1/102.pdf /*simulation*/ #include <iostream> #include<string.h> using namespace std; int main() { const string ans[6]={"BCG","BGC","CBG","CGB","GBC","GCB"}; int num[9],cal[6]; memset(num,0,sizeof(num)); memset(cal,0,sizeof(cal)); while(cin>>num[0]) { for(int c=1;c<9;c++) cin>>num[c]; //only move need to calculate cal[0]=num[3]+num[6]+num[2]+num[8]+num[1]+num[4];//bcg cal[1]=num[3]+num[6]+num[1]+num[7]+num[2]+num[5];//bgc cal[2]=num[5]+num[8]+num[0]+num[6]+num[1]+num[4];//cbg cal[3]=num[5]+num[8]+num[1]+num[7]+num[0]+num[3];//cgb cal[4]=num[4]+num[7]+num[0]+num[6]+num[2]+num[5];//gbc cal[5]=num[4]+num[7]+num[2]+num[8]+num[0]+num[3];//gcb int min=0, _ans=0,m =0; min=cal[0]; for(;m<6;m++) { if(min>cal[m]){ min=cal[m]; _ans=m; } } cout<<ans[_ans]<<" "...

ZeroJudge b898  : https://zerojudge.tw/ShowProblem?problemid=b898 /*large number*/ #include <iostream> #include <string> using namespace std; int main(int argc, const char * argv[]) {         // your code goes here     int count = 0;     cin>>count;     while(count--)     {         /*initial*/         string fir,sec,thi;                 cin>>fir>>sec>>thi;         string temp[3];         temp[0]=fir;         temp[1]=sec;         temp[2]=thi;                 string ans =temp[0];                 for(int i =1;i<3;i++)         {             if(ans.size()>temp[i].size...

UVA 10300  :  https://uva.onlinejudge.org/external/103/10300.pdf /*math*/ #include <iostream> using namespace std; int main() { // your code goes here int count =0; cin>>count; while(count--) { int farmer =0,total=0; cin>>farmer; for(int i=0;i<farmer;i++) { int area =0,num=0,level=0; cin>>area>>num>>level; total+=area*level; } cout<<total<<endl; } return 0; }

UVA 11727 :  https://uva.onlinejudge.org/external/117/11727.pdf /*sort*/ #include <iostream> #include <stdlib.h> #include <string.h> #include <algorithm> using namespace std; int main() { // your code goes here int count = 0,Case =1; cin >> count; while (count--) { int salary[3]; memset(salary, 0, sizeof(salary)); for (int i = 0; i < 3; i++) cin >> salary[i]; sort(salary, salary + 3); cout <<"Case "<<Case<<": "<< salary[1] << endl; Case++; } return 0; }

UVA 10082 : https://uva.onlinejudge.org/external/100/10082.pdf /*simulation*/ #include <iostream> #include <stdlib.h> #include <string.h> #include <sstream> #include <string> #define size_of_array(ary) sizeof(ary) / sizeof(ary[0]) using namespace std; int main() { // your code goes here string str; const char storage[] = "`1234567890-=QWERTYUIOP[]\\ASDFGHJKL;'ZXCVBNM,./"; while (getline(cin,str)){ for (int i = 0; i < str.length(); i++) { if (str[i]==' ') cout << " "; for (int j = 0; j < size_of_array(storage); j++) { if (str[i] == storage[j]) cout << storage[j - 1]; } } cout << endl; } system("PAUSE"); }

UVA10405 URL :  http://uva.onlinejudge.org/external/104/10405.pdf 基礎LCS ------------------------------------------------------------------------------------------ import java.util.Scanner; public class UVA10405 { public static void main(String[] args) { // TODO Auto-generated method stub Scanner sc = new Scanner(System.in); while(sc.hasNext()) { String s1 = sc.nextLine(); String s2 = sc.nextLine(); char[] c1 = new char[s1.length()+1]; char[] c2 = new char[s2.length()+1]; for(int s =1;s<s1.length()+1;s++) { c1[s] = s1.charAt(s-1); } for(int s =1;s<s2.length()+1;s++) { c2[s] = s2.charAt(s-1); } int matrix[][] = new int[1001][1001]; int max = 0; for(int n = 1;n<s1.length()+1;n++) { for(int m = 1;m<s2.length()+1;m++) { if(c1[n] == c2[m]) matrix[n][m] = matrix[n-1][m-1] + 1; else matrix[n][m] = Math.max(matrix[n...

UVA534 URL: http://uva.onlinejudge.org/external/5/534.pdf -------------------------------------------------------------- 大意 : 有隻青蛙想從A點跳到B點，問你A到B的路徑裡，最短的路徑裡權重最大的邊(最小生成樹的瓶頸) EX: path(start,2) = 3,path(2,3) =4 ,path(4,end) = 1 ,the distance is 4. -------------------------------------------------------------- import java.util.*; class undirected_graph { static double map[][] = new double[205][205]; static boolean visit[] = new boolean[205]; static double cost[] = new double[205]; static int parent[] = new int[205]; static int n = 0; void create_map(){ Scanner sc = new Scanner(System.in); int count =1; while(sc.hasNext()) { double map[][] = new double[205][205]; boolean visit[] = new boolean[205]; double cost[] = new double[205]; int parent[] = new int[205]; n = sc.nextInt(); sc.nextLine(); if(n==0)break; System.out.println("Scenario #"+count); int x_l[] = new int[n]; int y...