1.P5732 【深基5.习7】杨辉三角
寻找规律,利用二维数组
#include<iostream>
#include<cstdio>
#include<cstring>
#include<fstream>
#include<algorithm>
#include<cmath>
#include<deque>
#include<vector>
#include<queue>
#include<map>
#include<stack>
#include<set>
#define int long long int
using namespace std;
int a[22][22]={0};
signed main()
{
int n;
cin>>n;
a[1][1]=1;
for(int i=2;i<=n;i++)
{
for(int j=1;j<=i;j++)
{
a[i][j]=a[i-1][j-1]+a[i-1][j];
}
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=i;j++)
{
cout<<a[i][j]<<" ";
}
cout<<endl;
}
return 0;
}
2.P5744 【深基7.习9】培训
模拟,注意特殊点
#include<iostream>
#include<cstdio>
#include<cstring>
#include<fstream>
#include<algorithm>
#include<cmath>
#include<deque>
#include<vector>
#include<queue>
#include<map>
#include<stack>
#include<set>
#define int long long int
using namespace std;
signed main()
{
int n;
cin>>n;
while(n--)
{
string s;
cin>>s;
int a;
cin>>a;
double b;
cin>>b;
cout<<s<<" "<<a+1<<" ";
double ans=b*1.2;
if(ans<=600)
{
printf("%.0lf",b*1.2);
}
else{
cout<<"600";
}
cout<<endl;
}
return 0;
}
3.P2637 第一次,第二次,成交!
枚举,暴力,模拟
#include<iostream>
#include<cstdio>
#include<cstring>
#include<fstream>
#include<algorithm>
#include<cmath>
#include<deque>
#include<vector>
#include<queue>
#include<map>
#include<stack>
#include<set>
#define int long long int
using namespace std;
int a[1010];
signed main()
{
int n,m;
cin>>n>>m;
int c;
int ans=0;
for(int i=0;i<m;i++)
{
cin>>a[i];
}
for(int i=0;i<m;i++)
{
int sum=0;
for(int j=0;j<m;j++)
{
if(a[j]>=a[i])
{
sum++;
}
}
if(sum*a[i]>=ans)
{
c=a[i];
ans=max(ans,sum*a[i]);
}
}
cout<<c<<" "<<ans;
return 0;
}
4.P1426 小鱼会有危险吗
模拟
#include<iostream>
#include<cstdio>
#include<cstring>
#include<fstream>
#include<algorithm>
#include<cmath>
#include<deque>
#include<vector>
#include<queue>
#include<map>
#include<stack>
#include<set>
#define int long long int
using namespace std;
signed main()
{
double s,x;
cin>>s>>x;
double sum=0;
double a=7;
while(sum<s-x)
{
a=a*0.98;
sum+=a;
}
a=a*0.98;
sum+=a;
if(sum>s+x)
{
cout<<"n";
}
else{
cout<<"y";
}
return 0;
}
5. P7615 [COCI2011-2012#2] OKRET
模拟
#include<iostream>
#include<cstdio>
#include<cstring>
#include<fstream>
#include<algorithm>
#include<cmath>
#include<deque>
#include<vector>
#include<queue>
#include<map>
#include<stack>
#include<set>
#define int long long int
using namespace std;
char a[11][11];
signed main()
{
int r,c;
cin>>r>>c;
int f=0;
for(int i=1;i<=r;i++)
{
for(int j=1;j<=c;j++)
{
cin>>a[i][j];
}
}
for(int i=1;i<=r;i++)
{
for(int j=1;j<=c;j++)
{
int s=0;
if(a[i][j]=='.')
{
if(a[i-1][j]=='.')
{
s++;
}
if(a[i+1][j]=='.')
{
s++;
}
if(a[i][j-1]=='.')
{
s++;
}
if(a[i][j+1]=='.')
{
s++;
}
}
if(s==1)
{
f=1;
break;
}
}
}
if(f==1)
{
cout<<"1"<<endl;
}
else{
cout<<"0"<<endl;
}
return 0;
}