#include<iostream>
#include<math.h>
using namespace std;
#define int long long
solve(){
int n,d,len,e,c,f;
cin>>n>>d;
len=(int)log10(n)+1;
c=1234567890+d;
e=c*pow(10,len)+n;
f=e-e%n;
cout<<f/n<<endl;}
signed main(){
int t;
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
cin>>t;while(t--)solve();}
#include<bits/stdc++.h>
using namespace std;
struct s
{
int a,b;}p[200010];
int cmp(s l,s m){return l.a<m.a;}
int main(){
int n,e=0,f=0,g,sum=0,cnt=0;
cin>>n;for(int i=1;i<=n;i++){
cin>>p[i].a;
p[i].b=i;}sort(p+1,p+1+n,cmp);for(int i=1;i<=n;i++){
p[i].b=p[i].b-f+cnt;
cnt=0;if(p[i].b>=p[i].a){
sum=sum+p[i].b/p[i].a;
cnt+=p[i].b%p[i].a;
f+=(p[i].b/p[i].a)*p[i].a;}}
cout<<sum<<endl;return0;}
Problem F. 优秀字符串
题意及思路:按着题目要求一步一步判断即可
代码:
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,sum=0;
cin>>n;while(n--){
int a=0,b=0,c=0;
string s;
cin>>s;if(s.size()==5)
a=1;if(s[2]==s[4])
b=1;for(int i=0;i<=2;i++){for(int j=i+1;j<=3;j++){if(s[i]==s[j]){
c=1;break;}}}if(a==1&&b==1&&c==0)
sum++;}
cout<<sum<<endl;return0;}
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
signed main(){
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int t;
cin>>t;while(t--){
char x;
string a;
cin>>a;if((a[4]-'0')%2==0||a[4]=='5')
cout<<a[0]<<a[1]<<a[2]<<a[3]<<a[4]<<endl;else{for(int i=0;i<=3;i++){if((a[i]-'0')%2==0||(a[i]-'0')==5){
x=a[i],a[i]=a[4],a[4]=x;break;}}
cout<<a[0]<<a[1]<<a[2]<<a[3]<<a[4]<<endl;}}return0;}
#include<iostream>
using namespace std;
#define int long long
int a[300010];
int b[300010];
int n;
int check(int p){
int x=0,y=1e9;for(int i=1;i<=n;i++){
x=max(a[i]-p*b[i],x);
y=min(a[i]+p*b[i],y);if(x>y)return0;}return1;}
void solve(){
cin>>n;for(int i=1;i<=n;i++){
cin>>a[i];}for(int i=1;i<=n;i++){
cin>>b[i];}
int l=0,r=1e9;
int m;while(l<r){
m=l+r>>1;if(check(m))
r=m;else
l=m+1;}
cout<<l<<endl;}
signed main(){
int t;
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
cin>>t;while(t--)solve();}