USACO 1.1 四道題目

都是非常簡單的，剛剛開始學習C++，就從USACO入手吧！

 

【your ride is here】

/* ID: wangqia6 TASK: ride LANG: C++ */ # include<fstream> # include<string> int main() { using namespace std; ifstream infile; ofstream outfile; infile.open("ride.in"); outfile.open("ride.out"); string sa,sb; infile >> sa; infile >> sb; long a = 1,b = 1; for (int i = 0;i < sa.size();i++) a *= long(sa[i]) - long('A') + 1; for (int i = 0;i < sb.size();i++) b *= long(sb[i]) - long('A') + 1; a %= 47; b %= 47; string go="GO",stay="STAY"; if (a==b) outfile << go <<endl; else outfile << stay <<endl; infile.close(); outfile.close(); return 0; }

 

【greedy gift givers】

/* ID: wangqia6 TASK: gift1 LANG: C++ */ #include <fstream> #include <string> using namespace std; struct information { string name; int money,sum,left; }; int num_person; information person[10]; ifstream infile; ofstream outfile; int find(string sa) { for (int i = 0;i < num_person;i++) if (sa == person[i].name) return i; }; void makedata() { string str; infile >> str; int j=find(str); infile >> person[j].money; infile >> person[j].sum; if (person[j].sum == 0) { person[j].left += person[j].money; return; } int k,give; give = person[j].money / person[j].sum; for (int i = 0;i< person[j].sum;i++) { infile >> str; k=find(str); person[k].left += give; } person[j].left += person[j].money % person[j].sum; } int main() { infile.open("gift1.in"); outfile.open("gift1.out"); infile >> num_person; for (int i = 0;i < num_person;i++) infile >> person[i].name; for (int i = 0;i < num_person;i++) makedata(); for (int i = 0;i < num_person;i++) outfile << person[i].name << ' ' << person[i].left - person[i].money <<endl; return 0; }

 

【friday the thirteenth】

/* ID: wangqia6 TASK: friday LANG: C++ */ #include <fstream> #include <cstring> using namespace std; int getday(int y,int m) { switch(m) { case 1: case 3: case 5: case 7: case 8: case 10: case 12: return 31; break; case 4: case 6: case 9: case 11: return 30; break; case 2: if (y % 4 != 0) return 28; else if (y % 100 !=0) return 29; else if (y % 400 !=0) return 28; else return 29; } } int main() { ifstream infile; ofstream outfile; infile.open("friday.in"); outfile.open("friday.out"); int now = 0; int sum[7]; memset(sum,0,sizeof(sum)); int n,day,year = 1900,month = 1; infile >> n; do { sum[now]++; day = getday(year,month); now = (now + day) % 7; month++; if (month>12) { month = 1; year++; } } while (year <= 1900 + n - 1); for (int i = 0;i < 6;i++) outfile << sum[i] << " "; outfile << sum[6] << endl; return 0; }

 

【broken necklace】

/* ID: wangqia6 TASK: beads LANG: C++ */ #include <fstream> #include <string> using namespace std; int main() { ifstream infile; ofstream outfile; infile.open("beads.in"); outfile.open("beads.out"); int n; string str; infile >> n; infile >> str; str += str; int tmp,p,q,ans = -1; char now; for (int i = 0; i < n; i++) { p = 1; now = str[i]; while (p < n) if ((str[i+p] == now) || (str[i+p]) == 'w') p++; else if (now == 'w') { now = str[i+p]; p++; } else break; q = 1; now = str[i+p]; while (p + q < n) if ((str[i+p+q] == now) || (str[i+p+q] == 'w')) q++; else if (now == 'w') { now = str[i+p+q]; q++; } else break; if (p + q > ans) ans = p + q; } if (ans > n) ans = n; outfile << ans << endl; return 0; }