2018/7/27
P1035
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
1 //要记得加括号哦啊 2 #include<iostream> 3 using namespace std; 4 double sn; 5 int k; 6 int main(){ 7 cin>>k; 8 sn=1; 9 int i=1; 10 while(sn <= k){ 11 sn+=1.0/(i+1.0); 12 i=i+1; 13 } 14 int ans=i; 15 cout<<ans<<endl; 16 system("pause"); 17 return 0; 18 }
P1046
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
1 #include<iostream> 2 #include<algorithm> 3 using namespace std; 4 int a[10]; 5 int x; 6 int main(){ 7 for(int i=0;i<10;i++){ 8 cin>>a[i]; 9 } 10 cin>>x; 11 x=x+30; 12 sort(a,a+10); 13 int ans = 0; 14 for(int i=0;i<10;i++){ 15 if(x >= a[i]) ans++; 16 } 17 cout<<ans<<endl; 18 system("pause"); 19 return 0; 20 }
P1047
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
1 //打表做 2 //可以先预处理,排个序,剃掉一些数据 3 #include<iostream> 4 using namespace std; 5 int l,m; 6 int a[10010]; 7 8 int main(){ 9 cin>>l>>m; 10 for(int i=0;i<10010;i++ ){ 11 a[i]=0; 12 } 13 int x,y; 14 for(int j=0;j<m;j++){ 15 cin>>x>>y; 16 for(int k=x;k<=y;k++){ 17 a[k]=1; 18 } 19 } 20 int ans=0; 21 for(int i=0;i<10010;i++ ){ 22 if(a[i]) ans++; 23 } 24 ans=l-ans+1; 25 cout<<ans<<endl; 26 system("pause"); 27 return 0; 28 }
P1055
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
1 //字符用了ascii码存储,要再进行转换 2 //需要特判识别码为‘X’的情况 3 #include<cstdio> 4 #include<iostream> 5 using namespace std; 6 char a[13]; 7 int main(){ 8 gets(a); 9 //cout<<a[12]<<endl; 10 //puts(a); 11 int ans; 12 ans=((a[0]-'0')*1+(a[2]-'0')*2+(a[3]-'0')*3+(a[4]-'0')*4+(a[6]-'0')*5+(a[7]-'0')*6+(a[8]-'0')*7+(a[9]-'0')*8+(a[10]-'0')*9); 13 //cout<<ans<<endl; 14 ans=ans%11; 15 //cout<<ans<<endl; 16 if(ans == a[12]-'0'|| ans==10 && a[12]=='X') {cout<<"Right"<<endl;} 17 else if(ans == 10) {a[12]='X';puts(a);} 18 else {a[12]=ans+'0';puts(a);} 19 //system("pause"); 20 return 0; 21 }
P1423
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
1 // 2 #include<iostream> 3 using namespace std; 4 int step=1; 5 long double x=2; 6 long double ok=2; 7 long double dis; 8 int main(){ 9 cin>>dis; 10 while(ok<dis){ 11 ok+=x*0.98; 12 x=x*0.98; 13 step++; 14 } 15 cout<<step<<endl; 16 //system("pause"); 17 return 0; 18 19 20 21 }
P1427
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
1 //用stack 2 #include<cstdio> 3 #include<iostream> 4 using namespace std; 5 //#include<vector> 6 #include<stack> 7 stack<int > a; 8 int x; 9 int main(){ 10 while((scanf("%d",&x)!=EOF)){ 11 if(x!=0){ 12 a.push(x); 13 } 14 if(x == 0) break; 15 } 16 int flag=1; 17 while(!a.empty()){ 18 int temp=a.top(); 19 if(flag){ 20 flag=0; 21 cout<<temp; 22 } 23 else{ 24 cout<<" "<<temp; 25 } 26 a.pop(); 27 } 28 29 //system("pause"); 30 return 0; 31 }
P1200捏的飞碟在这儿
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
//继续打表?用结构体? //应该要去学习string的,不能只用char数组了 //用map? //直接循环一下也行? #include<iostream> using namespace std; string a,b; int main(){ cin>>a>>b; int ans1=1; int ans2=1; for(int i=0;i<a.size();i++){ ans1*=(a[i]-'A'+1); }//这里可以用数论同余的结论,先取余后除?、 ans1=ans1%47; for(int i=0;i<b.size();i++){ ans2*=(b[i]-'A'+1); }//这里可以用数论同余的结论,先取余后除?、 ans2=ans2%47; if(ans1 == ans2) cout<<"GO"<<endl; else cout<<"STAY"<<endl; return 0; }