A CodeForces 1285A Mezo Playing Zoma
签到题,直接输出。注意原点也算
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;cin>>n;
string s;cin>>s;
cout<<n+1<<endl;
return 0;
}
C CodeForces 1285C Fadi and LCM
暴力找因数,用GCD()判断两个因数的最大公因数是否为1,这样才能保证它俩的最小公倍数为X。
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll x;
int gcd(int a,int b)
{
return b==0?a:gcd(b,a%b);
}
int main()
{
while(cin>>x)
{
ll ans=x;
for(ll i=1;i*i<=x;i++)
{
if(!(x%i))
{
ll a=i,b=x/i;
if(gcd(a,b)==1)
ans=min(ans,b);
}
}
cout<<ans<<" "<<x/ans<<endl;
}
return 0;
}
E CodeForces 1288A Deadline
1.暴力
2.用一个不等式x+1+d/(x+1)-1>=2√d-1
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;cin>>t;
while(t--)
{
int n,d,f=0;cin>>n>>d;
for(int i=0;i*i<=d;i++)
{
int t=d%(i+1);
if(t) t=1;
if(i+d/(i+1)+t<=n)
{
f=1;break;
}
}
if(f) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
return 0;
}
F CodeForces 1288B Yet Another Meme Problem
等式推导
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int s[9]={9,99,999,9999,99999,999999,9999999,99999999,999999999};
int main()
{
int t;cin>>t;
while(t--)
{
ll a,b,cnt=0;
cin>>a>>b;
for(int i=8;i>=0;i--)
if(s[i]<=b)
{
cnt=i+1;break;
}
cout<<a*cnt<<endl;
}
return 0;
}
F CodeForces 1288B Yet Another Meme Problem
签到,按照题意写就行
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
while(cin>>s){
int f=0;
for(int i=0;i<s.size();i++)
if(s[i]=='H'||s[i]=='Q'||s[i]=='9')
{
f=1;break;
}
if(f) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
return 0;
}