zoj
da_fan_shu_
这个作者很懒,什么都没留下…
展开
-
zoj 1001.Digital Roots
Digital Roots#include#includeusing namespace std;int main(){ string s; int sum=0; while(cin>>s) { if(s=="0") break; sum=0; for(int i=0;i<s.size();i++) { sum+=(s[i原创 2012-10-15 15:01:07 · 230 阅读 · 0 评论 -
zoj 1949.Error Correction
Error Correction#includeusing namespace std;int matrix[100][100];int sl[100];int sc[100];int main(){ int n; while(cin>>n) { if(n==0) break; int cl=0,cc=0; int pl=0,pc=原创 2012-10-22 23:24:29 · 372 阅读 · 0 评论 -
zoj 2060.Fibonacci Again
Fibonacci Again#include #include #include using namespace std;vector v;int main(int argc, char* argv[]){// ifstream cin("aaa.txt"); unsigned int n1,n2,t; unsigned int n; int i;原创 2012-10-23 14:32:05 · 232 阅读 · 0 评论 -
zoj 2104.Let the Balloon Rise
Let the Balloon Rise#include #include #include #include using namespace std;int main(int argc, char* argv[]){// ifstream cin("aaa.txt"); mapm; int n; int i; string s; map::it原创 2012-10-23 22:40:47 · 241 阅读 · 0 评论 -
zoj 2136.Longest Ordered Subsequence
Longest Ordered Subsequence#include #include #include using namespace std;//定义结构体Info,用来保存一个终点数据的信息struct Info{ int index;//该数据的序号,1,2,3,...,n int a;//该数据 int length;//以该数据为终点的最长子系列长原创 2012-10-24 00:01:34 · 223 阅读 · 0 评论 -
zoj 2095.Divisor Summation
Divisor Summation#include #include #include using namespace std;int m[500000];int main(int argc, char* argv[]){ //ifstream cin("aaa.txt"); int i,j; int n; int d; d=sqrt(500000.原创 2012-10-23 15:49:58 · 402 阅读 · 0 评论 -
zoj 2109.FatMouse' Trade
FatMouse' Trade#include #include #include #include using namespace std;//数据存取结构struct Mouse{ double J; double F; double a;};//自定义排序比较规则bool Comp(const Mouse &d1,const Mouse &原创 2012-10-23 23:41:44 · 276 阅读 · 0 评论 -
zoj 2201.No Brainer
No Brainer#include #include using namespace std;int main(int argc, char* argv[]){// ifstream cin("aaa.txt"); int a,b; cin>>a; while(cin>>a>>b) { if(a<b)cout<<"NO BRAINS"<<endl;原创 2012-11-05 23:33:46 · 217 阅读 · 0 评论 -
zoj 2388.Beat the Spread!
Beat the Spread!#include #include #include using namespace std;int main(int argc, char* argv[]){// ifstream cin("aaa.txt"); int n,x,y,a,b; cin>>n;//不理会第一个数字 while(cin>>a>>b) {原创 2012-11-05 23:37:00 · 377 阅读 · 0 评论 -
zoj 2420.Calendar
Calendar#include #include #include using namespace std;//以下为阳历年月日的常识//一年有12个月//1 3 5 7 8 10 12月为大月,每月有31天//4 6 9 11月为小月,每月有30天//如果是闰年,2月有29天,否则,2月只有28天//定义打印日期结构struct Info{ sh原创 2012-11-05 23:45:02 · 225 阅读 · 0 评论 -
zoj 2176.Speed Limit
Speed Limit#include #include using namespace std;int main(int argc, char* argv[]){// ifstream cin("aaa.txt"); int n,a,b,bb,sum,i; while(cin>>n) { if(n==-1)break; sum=0; bb=0原创 2012-11-05 23:29:06 · 259 阅读 · 0 评论 -
zoj 2417.Lowest Bit
Lowest Bit#include #include #include using namespace std; int main(int argc, char* argv[]){// ifstream cin("aaa.txt"); int n,num; while(cin>>n) { num=0; if(n==0)break; w原创 2012-11-05 23:42:52 · 185 阅读 · 0 评论 -
zoj 2132.The Most Frequent Number
The Most Frequent Number#include#includestruct Node{ int e,n; Node *next;};int L;Node* A;int X;int main(){ int e; Node* p,* q,* r; A=NULL; while(scanf("%d",&L)==1){原创 2012-10-20 10:18:28 · 398 阅读 · 0 评论 -
zoj 2508.A Less Simple Task in Windows
A Less Simple Task in Windows#includeconst int MAX_N=5;const int MAX_M=30;int N, M;int H, Wmax, Hmax;int owins[MAX_N][4];int cwins[MAX_N][6];int ans[MAX_M];int x, y, lx, ly;int原创 2012-11-12 22:51:30 · 400 阅读 · 0 评论 -
zoj 2001.Adding Reversed Numbers
Adding Reversed Numbers#include#include#includeusing namespace std;int main(){ string s,t,str,str1; int a,b; int n,i; cin>>n; while(n--) { cin>>s>>t; if(s.size()>=t.size(原创 2012-10-22 23:44:07 · 254 阅读 · 0 评论 -
zoj 1763.A Simple Question of Chemistry
A Simple Question of Chemistry#include #include using namespace std;int main(int argc, char* argv[]){ //ifstream cin("aaa.txt"); double a,b; cin>>a; //cout.precision(2); while(cin>原创 2012-10-18 19:05:10 · 315 阅读 · 0 评论 -
zoj 1151.Word Reversal
Word Reversal#include#include#include#include#includeusing namespace std;int main(){ int N,n; char str1[90]; string str,s; cin>>N; getchar(); while(N--) {原创 2012-10-15 15:12:43 · 352 阅读 · 0 评论 -
zoj 1109.Language of FatMouse
Languange of FatMouse#include #include #include #include using namespace std;//采用gets()输入比getline()快得多,但gets()不能从cin中读取数据,调试上不易//gets函数用法://从stdin流中读取字符串,直至接受到换行符或EOF时停止,//并将读取的结果存放在原创 2012-10-15 14:46:12 · 603 阅读 · 0 评论 -
zoj 1188.DNA Sorting
DNA Sorting#include#includeusing namespace std;struct node{ int num; char a[51];}data[101];int cal(char* s,int n){ int i=0; int a[4]={0},total=0; for(i=n-1;i>=0;i--) { s原创 2012-10-15 22:58:47 · 292 阅读 · 0 评论 -
zoj 1205.Martian Addition
Martian Addition#include #include #include //向量#include //字符容器#include //算法using namespace std;int main(int argc, char* argv[]){// ifstream cin("aaa.txt"); string sa,sb,t; vector原创 2012-10-15 23:26:53 · 336 阅读 · 0 评论 -
zoj 1240.IBM Minus One
IBM Minus One#include #include #include using namespace std;int main(int argc, char* argv[]){ //ifstream cin("aaa.txt"); int n; string s; cin>>n; for(int i=0;i<n;i++) { cin>原创 2012-10-16 18:02:26 · 299 阅读 · 0 评论 -
zoj 1383.Binary Numbers
Binary Numbers#include #includeusing namespace std;int main(){ vectorv; int d; int n; cin>>n; for(int i=0;i<n;i++) { cin>>d; for(int j=d;j;j=j/2) { v.push_back(j%2?1原创 2012-10-17 09:00:35 · 250 阅读 · 0 评论 -
zoj 1392.The Hardest Problem Ever
The Hardest Problem Ever#include #include #include #include using namespace std;int main(int argc, char* argv[]){// ifstream cin("aaa.txt"); string s; char ss[200]; mapm; m['原创 2012-10-17 09:05:46 · 290 阅读 · 0 评论 -
zoj 1241.Geometry Made Simple
Geometry Made Simple#include #include using namespace std;int main(int argc, char* argv[]){// ifstream cin("aaa.txt"); int a,b,c,n; n=0; cout.precision(3);//有效数字三位 while(cin>>a>>b>原创 2012-10-16 18:08:15 · 230 阅读 · 0 评论 -
zoj 1251.Box of Bricks
Box of Bricks#include#includeusing namespace std;int main(){ int n,m; int sum,ave; int res,c=0; vectorv; while(cin>>n) { if(n==0) break; res=0; c++; sum=0; v.c原创 2012-10-16 18:13:31 · 261 阅读 · 0 评论 -
zoj 1295.Reverse Text
Reverse Text#include#include#include#includeusing namespace std;int main(){ int n; string s; char ch[80]; cin>>n; getchar(); while(n--) { cin.getline(ch,80); s=ch;原创 2012-10-16 18:21:15 · 213 阅读 · 0 评论 -
zoj 1315.Excuses, Excuses!
Excuses, Excuses!#include #include #include #include #include using namespace std;//结构体,用来保存语句行及其包含的关键词个数struct Info{ //字符行 string s; //本字符行包含了关键词个数 int n;};//自定义比较函数,按包含关键原创 2012-10-16 19:24:03 · 258 阅读 · 0 评论 -
zoj 1760.Doubles
Doubles#include #include #include using namespace std;int main(int argc, char* argv[]){// ifstream cin("aaa.txt"); sets; set::iterator it,itt; int sum=0; int n; while(cin>>n)原创 2012-10-17 22:22:28 · 259 阅读 · 0 评论 -
zoj 1698.Easier Done Than Said?
Easier Done Than Said?#include #include #include using namespace std;int main(int argc, char* argv[]){// ifstream cin("aaa.txt"); string s; int a,b; int i,t; while(cin>>s) {原创 2012-10-17 22:14:22 · 206 阅读 · 0 评论 -
zoj 3114.Double Queue
Double Queue#include#include#include using namespace std;int main(){ mapmp; map::iterator it; int r,k,p; while(scanf("%d",&r)&&r!=0){ if(r==1){ scanf("%d %d",&k,&p); mp[原创 2012-11-28 21:19:05 · 340 阅读 · 0 评论