A. Multiplication Table

Time Limit: 1 Sec ?

Memory Limit: 256 MB

題目連接

http://codeforces.com/contest/577/problem/A

Description

Let's consider a table consisting of?n?rows and?n?columns. The cell located at the intersection of?i-th row and?j-th column contains number?i?×?j. The rows and columns are numbered starting from 1.

You are given a positive integer?x. Your task is to count the number of cells in a table that contain number?x.

Input

The single line contains numbers?n?and?x?(1?≤?n?≤?105,?1?≤?x?≤?109) — the size of the table and the number that we are looking for in the table.

Output

Print a single number: the number of times?x?occurs in the table.

Sample Input

10 5

Sample Output

2

HINT

?

題意

給你n,m，相當于給了你一個n*n的乘法表，然后問你這個乘法表里面有多少個格子等于m

題解：

sqrt暴力枚舉因子就好了

代碼：

//qscqesze #include <cstdio> #include <cmath> #include <cstring> #include <ctime> #include <iostream> #include <algorithm> #include <set> #include <bitset> #include <vector> #include <sstream> #include <queue> #include <typeinfo> #include <fstream> #include <map> #include <stack> typedef long long ll; using namespace std; //freopen("D.in","r",stdin); //freopen("D.out","w",stdout); #define sspeed ios_base::sync_with_stdio(0);cin.tie(0) #define maxn 200500 #define mod 1001 #define eps 1e-9 #define pi 3.1415926 int Num; //const int inf=0x7fffffff; const ll inf=999999999; inline ll read() {ll x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}return x*f; } //*************************************************************************************int main() {int n=read(),x=read();int ans=0;for(int i=1;i<=sqrt(x);i++){if(x%i==0){if(i<=n&&x/i<=n)ans+=2;if(i<=n&&i==x/i)ans--;}}cout<<ans<<endl; }

?

總結

以上是生活随笔為你收集整理的Codeforces Codeforces Round #319 (Div. 2) A. Multiplication Table 水题的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。