首页 > 代码库 > Codeforces Round #282 (Div. 2) b
Codeforces Round #282 (Div. 2) b
/** * @brief Codeforces Round #282 (Div. 2) b * @file b.cpp * @author mianma * @created 2014/12/15 9:55 * @edited 2014/12/15 9:55 * @type math * @note */ #include <fstream> #include <iostream> #include <cstring> #include <cmath> using namespace std; #define max(a, b) ((a) > (b) ? (a) : (b)) #define min(a, b) ((a) > (b) ? (b) : (a)) #define abs(a) ((a) > 0 ? (a) : (0 - (a))) #define CLR(vec) memset(vec, 0, sizeof(vec)) #ifdef DEBUG ifstream in; ofstream out; #define CIN in #define COUT out #else #define CIN cin #define COUT cout #endif int a, b, c, cnt; double cf; int main(void){ ios_base::sync_with_stdio(0); #ifdef DEBUG CIN.open("./in", ios::in); COUT.open("./out", ios::out); #endif CIN >> a >> b; if(a == b){ COUT << "infinity\n"; return 0; } if(a < b){ COUT << "0\n"; return 0; } a -= b; cf = sqrt((double)a); c = (int)floor(cf + 0.5); cnt = 0; for(int i = 1; i <= c; i++){ if( 0 == a%i){ if(a/i > b) ++cnt; if(i > b) ++cnt; } } #ifdef DEBUG COUT << cf << " <-> " << c << "\n"; #endif if(cf == c){ if(0 == a%c && c > b) --cnt; } COUT << cnt << "\n"; return 0; }
Codeforces Round #282 (Div. 2) b
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。