A. Multiplication

A. Multiplication
Tabletime limit per test1 second
memory limit per test256 megabytes
input standard input
output standard output
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.
Examples
Input
10 5
Output
2
Input
6 12
Output
4
Input
13
Output
0

#include<stdio.h>
#include<math.h>
int main()
{
 int n,x,i,j=0,a;
 scanf("%d %d",&n,&x);
 for(i=2;i<=n;i++)
 {
	  if(x%i==0)
	  {
	   	a=x/i;
	  	 if(a<=n)
	  	 {
	  		  j++;
	   	}
	  }
 }
	 if(x<=n)
	 {
 		 j+=1;
  		printf("%d\n",j);
  		return 0;
	 }
	 else
	 {
		  printf("%d\n",j); 
	 }
 return 0;
 } 



  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值