当前位置:网站首页>Find 3-friendly Integers
Find 3-friendly Integers
2022-07-06 16:02:00 【It's Xiao Zhang, ZSY】
Find 3-friendly Integers
link :https://ac.nowcoder.com/acm/contest/11166/F
source : Cattle from
A positive integer is 3-friendly if and only if we can find a continuous substring in its decimal representation, and the decimal integer represented by the substring is a multiple of 3.
For instance:
104 is 3-friendly because “0” is a substring of “104” and 0mod3=0.
124 is 3-friendly because “12” is a substring of “124” and 12mod3=0. “24” is also a valid substring.
17 is not 3-friendly
Note that the substring with leading zeros is also considered legal.
Given two integers L and R, you are asked to tell the number of positive integers x such that L R(L≤x≤R) and x is 3-friendly.
Input description :
There are multiple test cases. The first line of the input contains an integer T(1≤T≤10000), indicating the number of test cases. For each test case:
The only line contains two integers L,R(1≤L≤R≤10^18 ), indicating the query.
Output description :
For each test case output one line containing an integer, indicating the number of valid {x}x.
Ideas :
In fact, it is before the calculation 100 individual ,100 The numbers in the future are 3 Friendly
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll sum[105];
ll a(ll x)
{
if(x<=99)
return sum[x];
if(x>99)
{
return sum[99]+x-99;
}
}
int main()
{
for(int i=1;i<=9;i++)
{
ll cc=0;
if(i%3==0)
cc=1;
sum[i]=sum[i-1]+cc;
}
for(int i=10;i<=99;i++)
{
ll cc=0;
if(i%3==0)
{
cc=1;
}
if(i/10%3==0)
{
cc=1;
}
if(i%10%3==0)
{
cc=1;
}
sum[i]=sum[i-1]+cc;
}
int T;
cin>>T;
while(T--)
{
ll l,r;
cin>>l>>r;
cout<<a(r)-a(l-1)<<endl;
}
return 0;
}
边栏推荐
- Ball Dropping
- JS调用摄像头
- CEP used by Flink
- 1010 things that college students majoring in it must do before graduation
- b站 實時彈幕和曆史彈幕 Protobuf 格式解析
- Essai de pénétration (1) - - outils nécessaires, navigation
- 差分(一维,二维,三维) 蓝桥杯三体攻击
- Opencv learning log 31 -- background difference
- Opencv learning log 13 corrosion, expansion, opening and closing operations
- Auto.js入门
猜你喜欢
渗透测试 2 --- XSS、CSRF、文件上传、文件包含、反序列化漏洞
STM32 how to use stlink download program: light LED running light (Library version)
Penetration testing (5) -- a collection of practical skills of scanning King nmap and penetration testing tools
Information security - threat detection - detailed design of NAT log access threat detection platform
7-1 懂的都懂 (20 分)
渗透测试 ( 7 ) --- 漏洞扫描工具 Nessus
frida hook so层、protobuf 数据解析
信息安全-威胁检测引擎-常见规则引擎底座性能比较
快速转 TypeScript 指南
C语言数组的概念
随机推荐
b站 实时弹幕和历史弹幕 Protobuf 格式解析
STM32 how to use stlink download program: light LED running light (Library version)
【练习-11】4 Values whose Sum is 0(和为0的4个值)
渗透测试 ( 2 ) --- 渗透测试系统、靶机、GoogleHacking、kali工具
Opencv learning log 32 edge extraction
CEP used by Flink
Borg Maze (BFS+最小生成树)(解题报告)
The most complete programming language online API document
Penetration test (3) -- Metasploit framework (MSF)
China's peripheral catheter market trend report, technological innovation and market forecast
HDU - 6024 Building Shops(女生赛)
Shell脚本编程
[exercise-6] (PTA) divide and conquer
Opencv learning log 15 count the number of solder joints and output
【练习-2】(Uva 712) S-Trees (S树)
【练习-9】Zombie’s Treasure Chest
Information security - Analysis of security orchestration automation and response (soar) technology
C语言数组的概念
Find 3-friendly Integers
Research Report on market supply and demand and strategy of China's earth drilling industry