https://www.luogu.com.cn/training/101#problems

P2433 【深基1-2】小学数学 N 合一

  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. void solve1() {cout<<"I love Luogu!";}
  4. void solve2() {cout<<6<<" "<<4;}
  5. void solve3() {cout<<3<<'\n'<<12<<'\n'<<2;}
  6. void solve4() {printf("%6.3lf",500.0/3);}
  7. void solve5() {cout<<480/32;}
  8. void solve6() {cout<<sqrt(6*6+9*9)<<endl;}
  9. void solve7() 
  10. {
  11.     cout<<110<<'\n';
  12.     cout<<90<<'\n';
  13.     cout<<0<<'\n';
  14. }
  15. void solve8()
  16. {
  17.     double pi=3.141593;
  18.     cout<<pi*5*2<<endl;
  19.     cout<<pi*5*5<<endl;
  20.     cout<<4.0/3.0*pi*5*5*5<<endl;
  21. }
  22. void solve9(){cout<<22<<endl;}
  23. void solve10(){cout<<9;}
  24. void solve11(){cout<<100.0/3;}
  25. void solve12()
  26. {
  27.     cout<<'M'-'A'+1<<endl;
  28.     printf("%c\n",'A'+17);
  29. }
  30. void solve13()
  31. {
  32.     double pi=3.141593;
  33.     double sum=4.0/3*pi*4*4*4+4.0/3*pi*10*10*10;
  34.     for(int i=1;i<=300;i++)
  35.     {
  36.         if(i*i*i>sum)
  37.         {
  38.             cout<<i-1;
  39.             break;
  40.         }
  41.     }
  42. }
  43. void solve14(){cout<<50;}
  44. int main(void)
  45. {
  46.     int t; cin>>t;
  47.     switch(t)
  48.     {
  49.         case 1:solve1();break;
  50.         case 2:solve2();break;
  51.         case 3:solve3();break;
  52.         case 4:solve4();break;
  53.         case 5:solve5();break;
  54.         case 6:solve6();break;
  55.         case 7:solve7();break;
  56.         case 8:solve8();break;
  57.         case 9:solve9();break;
  58.         case 10:solve10();break;
  59.         case 11:solve11();break;
  60.         case 12:solve12();break;
  61.         case 13:solve13();break;
  62.         case 14:solve14();break;
  63.     }
  64.     return 0;
  65. }

P5709 【深基2.习6】Apples Prologue / 苹果和虫子

  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. int main(void)
  4. {
  5.     int m,t,s; cin>>m>>t>>s;
  6.     if(t==0)
  7.     {
  8.         cout<<0;
  9.         return 0;
  10.     }
  11.     int temp=s/t;
  12.     if(s%t) temp++;
  13.     cout<<max(m-temp,0);
  14.     return 0;
  15. }

P5710 【深基3.例2】数的性质

  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. int main(void)
  4. {
  5.     int n; cin>>n;
  6.     int cnt=0;
  7.     if(n%2==0) cnt++;
  8.     if(n>=4&&n<=12) cnt++;
  9.     if(cnt==2) cout<<"1 ";
  10.     else cout<<"0 ";
  11.     if(cnt>=1) cout<<"1 ";
  12.     else cout<<"0 ";
  13.     if(cnt==1) cout<<"1 ";
  14.     else cout<<"0 ";
  15.     if(cnt==0) cout<<"1 ";
  16.     else cout<<"0 ";
  17.     return 0;
  18. }

P5711 【深基3.例3】闰年判断

  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. int check(int x)
  4. {
  5.     if(x%400==0||(x%4==0&&x%100!=0)) return 1;
  6.     else return 0;
  7. }
  8. int main(void)
  9. {
  10.     int n; cin>>n;
  11.     cout<<check(n);
  12.     return 0;
  13. }

P5712 【深基3.例4】Apples

  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. int main(void)
  4. {
  5.     int n; cin>>n;
  6.     if(n==1) puts("Today, I ate 1 apple.");
  7.     else if(n==0) puts("Today, I ate 0 apple.");
  8.     else printf("Today, I ate %d apples.",n);
  9.     return 0;
  10. }

P5713 【深基3.例5】洛谷团队系统

  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. int main(void)
  4. {
  5.     int n; cin>>n;
  6.     int a1=n*5,a2=n*3+11;
  7.     if(a1<=a2) puts("Local");
  8.     else puts("Luogu");
  9.     return 0;
  10. }

P5714 【深基3.例7】肥胖问题

  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. int main(void)
  4. {
  5.     double m,h; cin>>m>>h;
  6.     double ans=m/(h*h);
  7.     if(ans<18.5) puts("Underweight");
  8.     else if(ans>=18.5&&ans<24) puts("Normal");
  9.     else cout<<ans<<'\n'<<"Overweight";
  10.     return 0;
  11. }

P5715 【深基3.例8】三位数排序

  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. int a[15];
  4. int main(void)
  5. {
  6.     for(int i=0;i<3;i++) cin>>a[i];
  7.     sort(a,a+3);
  8.     for(int i=0;i<3;i++) cout<<a[i]<<" ";
  9.     return 0;
  10. }

P5716 【深基3.例9】月份天数

  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. int m[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
  4. int check(int x)
  5. {
  6.     if(x%400==0||(x%4==0&&x%100!=0)) return 1;
  7.     return 0;
  8. }
  9. int main(void)
  10. {
  11.     int a,b; cin>>a>>b;
  12.     if(check(a)) m[2]=29;
  13.     cout<<m[b];
  14.     return 0; 
  15. }

P1085 [NOIP2004 普及组] 不高兴的津津

  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. int main(void)
  4. {
  5.     int ans=0,temp=8;
  6.     for(int i=1;i<=7;i++)
  7.     {
  8.         int a,b; cin>>a>>b;
  9.         if(a+b>temp)
  10.         {
  11.             temp=a+b;
  12.             ans=i;
  13.         }
  14.     }
  15.     cout<<ans;
  16.     return 0; 
  17. }

P1909 [NOIP2016 普及组] 买铅笔

  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. int main(void)
  4. {
  5.     int n,ans=1e9;
  6.     cin>>n;
  7.     for(int i=1;i<=3;i++)
  8.     {
  9.         int v,p; cin>>v>>p;
  10.         ans=min(ans,((n/v)+(n%v!=0))*p);
  11.     }
  12.     cout<<ans;
  13.     return 0; 
  14. }

P5717 【深基3.习8】三角形分类

  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. long long int a[3];
  4. int main(void)
  5. {
  6.     for(int i=0;i<3;i++) cin>>a[i];
  7.     sort(a,a+3);
  8.     if((a[0]+a[1])<=a[2])
  9.     {
  10.         puts("Not triangle");
  11.         return 0;
  12.     }
  13.     if((a[0]*a[0]+a[1]*a[1]) == (a[2]*a[2]) ) puts("Right triangle");
  14.     if((a[0]*a[0]+a[1]*a[1]) > (a[2]*a[2]) )  puts("Acute triangle");
  15.     if((a[0]*a[0]+a[1]*a[1]) < (a[2]*a[2]) )  puts("Obtuse triangle");
  16.     if( (a[0]==a[1]) || (a[1]==a[2]) )        puts("Isosceles triangle");
  17.     if( (a[0]==a[1]) && (a[1]==a[2]) )        puts("Equilateral triangle");
  18.     return 0; 
  19. }

P1422 小玉家的电费

  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. int main(void)
  4. {
  5.     int n; cin>>n;
  6.     if(n<=150) printf("%.1lf",n*0.4463);
  7.     else if(n>150&&n<=400) printf("%.1lf",150*0.4463+(n-150)*0.4663);
  8.     else printf("%.1lf",150*0.4463+250*0.4663+(n-400)*0.5663); 
  9.     return 0; 
  10. }

P1424 小鱼的航程(改进版)

  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. int main(void)
  4. {
  5.     int cnt,n;
  6.     cin>>cnt>>n;
  7.     int sum=0;
  8.     for(int i=1;i<=n;i++)
  9.     {
  10.         if(cnt!=6&&cnt!=7) sum+=250;
  11.         cnt++;
  12.         if(cnt==8) cnt=1;
  13.     }
  14.     cout<<sum;
  15.     return 0;
  16. }

P1888 三角函数

  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. int gcd(int a,int b)
  4. {
  5.     return b?gcd(b,a%b):a;
  6. }
  7. int main(void)
  8. {
  9.     int a[3]; cin>>a[0]>>a[1]>>a[2];
  10.     sort(a,a+3);
  11.     int temp=gcd(a[0],a[2]);
  12.     cout<<a[0]/temp<<"/"<<a[2]/temp; 
  13.     return 0;
  14. }

P1046 [NOIP2005 普及组] 陶陶摘苹果

  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. int a[15],cnt,h;
  4. int main(void)
  5. {
  6.     for(int i=0;i<10;i++) cin>>a[i];
  7.     cin>>h;
  8.     for(int i=0;i<10;i++) if(h+30>=a[i]) cnt++;
  9.     cout<<cnt;
  10.     return 0; 
  11. }

P4414 [COCI2006-2007#2] ABC

  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. int a[15];
  4. int main(void)
  5. {
  6.     for(int i=0;i<3;i++) cin>>a[i];
  7.     sort(a,a+3);
  8.     string s;cin>>s;
  9.     for(int i=0;i<s.size();i++)
  10.     {
  11.         cout<<a[s[i]-'A']<<" ";
  12.     }
  13.     return 0;
  14. }

P1055 [NOIP2008 普及组] ISBN 号码

  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. int main(void)
  4. {
  5.     string s; cin>>s;
  6.     int sum=0;
  7.     for(int i=0,j=1;i<s.size()-1;i++)
  8.         if(s[i]>='0'&&s[i]<='9') sum=sum+(s[i]-'0')*j,j++;
  9.     sum=sum%11;
  10.     int temp=s[s.size()-1]-'0';
  11.     if(sum==temp || sum==10 && s[s.size()-1]=='X' ) puts("Right");
  12.     else 
  13.     {
  14.         for(int i=0;i<s.size()-1;i++) cout<<s[i];
  15.         if(sum!=10) cout<<sum;
  16.         else cout<<'X';
  17.     }
  18.     return 0;
  19. }