https://atcoder.jp/contests/abc214/tasks/abc214_a
水波逐流
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<queue>
#include<stack>
#include<map>
#include<vector>
#define ll long long
#define ull unsigned long long
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,a,n) for (int i=n;i>=a;i--)
#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
inline ll read()
{
ll x=0,w=1; char ch=0;ch=getchar();
while(ch>'9'||ch<'0'){if(ch=='-')w=-1;ch=getchar();}
while(ch<='9'&&ch>='0'){x=(x<<3)+(x<<1)+(ch-48);ch=getchar();}
return x*w;
}
inline void print(ll x)
{
if(x<0){x=-x;putchar('-');}
if(x>9)print(x/10);
putchar(x%10+48);
}
int n;
int main()
{
ios
cin>>n;
if(n<=125)cout<<4<<endl;
else if(n<=211)cout<<6<<endl;
else if(n<=214)cout<<8<<endl;
return 0;
}
https://atcoder.jp/contests/abc214/tasks/abc214_b
简单模拟
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<queue>
#include<stack>
#include<map>
#include<vector>
#define ll long long
#define ull unsigned long long
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,a,n) for (int i=n;i>=a;i--)
#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
inline ll read()
{
ll x=0,w=1; char ch=0;ch=getchar();
while(ch>'9'||ch<'0'){if(ch=='-')w=-1;ch=getchar();}
while(ch<='9'&&ch>='0'){x=(x<<3)+(x<<1)+(ch-48);ch=getchar();}
return x*w;
}
inline void print(ll x)
{
if(x<0){x=-x;putchar('-');}
if(x>9)print(x/10);
putchar(x%10+48);
}
int s,t,ans;
int main()
{
ios
cin>>s>>t;
int cnt=0;
for(int i=0;i<=100;i++)
{
for(int j=0;j<=100;j++)
{
for(int k=0;k<=100;k++)
{
if(i+j+k<=s&&i*j*k<=t)cnt++;
}
}
}
cout<<cnt<<endl;
return 0;
}
https://atcoder.jp/contests/abc214/tasks/abc214_c
给两个数组a,b,a是宝石传递给下一个人的时间,b是得到宝石的时间。
有n个人逆时针排成一圈,第一个人拿到宝石后传递给下一个人,问每个人得到宝石的最早时间是什么。(第n个人会给第一个人)
这题你选定的这个人可能会从再上一个人得到宝石。那么谁不会从上一个人得到宝石呢?自然是最早把宝石传递出去的人。找到最早传递宝石的人,模拟即可。
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<queue>
#include<stack>
#include<map>
#include<vector>
#define ll long long
#define ull unsigned long long
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,a,n) for (int i=n;i>=a;i--)
#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
inline ll read()
{
ll x=0,w=1; char ch=0;ch=getchar();
while(ch>'9'||ch<'0'){if(ch=='-')w=-1;ch=getchar();}
while(ch<='9'&&ch>='0'){x=(x<<3)+(x<<1)+(ch-48);ch=getchar();}
return x*w;
}
inline void print(ll x)
{
if(x<0){x=-x;putchar('-');}
if(x>9)print(x/10);
putchar(x%10+48);
}
int s,t,ans;
int main()
{
ios
cin>>s>>t;
int cnt=0;
for(int i=0;i<=100;i++)
{
for(int j=0;j<=100;j++)
{
for(int k=0;k<=100;k++)
{
if(i+j+k<=s&&i*j*k<=t)cnt++;
}
}
}
cout<<cnt<<endl;
return 0;
}