Submission #2408574
Source Code Expand
//Create Time: 2018-04-24 10:17:54
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <cstdlib>
#include <sstream>
#include <fstream>
#include <functional>
#include <list>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cctype>
#include <ctime>
#include <utility>
#include <complex>
#include <cassert>
#include <climits>
#include <iterator>
#include <tuple>
using namespace std;
#define snuke(i,x) for (__typeof((x).begin()) i = (x).begin(); i != (x).end(); ++i)
#define rep(i,a,n) for (int i=(a);i<(n);i++)
#define per(i,n,a) for (int i=(n)-1;i>=(a);i--)
// #define OUT(x) std::cout<<(#x)<<":"<<(x)<<std::endl
// #define TST(x) std::cout<<(#x)<<":"<<(x)<<" "
#define OUT(args...) {string _s=#args;replace(_s.begin(),_s.end(),',',' ');stringstream _ss(_s);istream_iterator<string> _it(_ss);OUT_TST("\n",_it,args);}
#define TST(args...) {string _s=#args;replace(_s.begin(),_s.end(),',',' ');stringstream _ss(_s);istream_iterator<string> _it(_ss);OUT_TST("",_it,args);}
#define SZ(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
#define unq(x) sort(all(x)),(x).erase(unique(all(x)),(x).end())
#define mem(f,x) memset((f), (x), sizeof(f))
#define clr(f) mem(f,0)
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define mt make_tuple
#define eb emplace_back
#define DEBUG
void OUT_TST(string s,istream_iterator<string> it) {cerr<<s;}
template<typename T, typename... Args> void OUT_TST(string s,istream_iterator<string> it,T a,Args... args){cerr<<*it<<"="<<a<<" ";OUT_TST(s,++it,args...);}
template<class T> void rd(T&ret){ret=0;bool ok=0,u=0;for(;;){int c=getchar();if(c>='0'&&c<='9')ret=(ret<<3)+(ret<<1)+c-'0',ok=1;else if(c=='-')u=1;else if(ok){if(u)ret*=-1;return;}}}
long long powmod(long long p,long long n,long long mod){long long ret=1;for(;n;n>>=1){if(n&1)ret=ret*p%mod;p=p*p%mod;}return ret;}
template <class T> bool chmin(T& a, const T &b) {return b < a? a = b, 1: 0;}
template <class T> bool chmax(T& a, const T &b) {return b > a? a = b, 1: 0;}
int gcd(int a,int b){return b?gcd(b,a%b):a;}
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii > vii;
/****head****/
ll a,b,p;
void small(){
set<ll> hs;
ll ans=0;
for(ll i=1,j;i<=p;++i){
if(i==a)continue;
j=p/i;
if(i*j==p)--j;
while(hs.find(j)!=hs.end() || j==b)--j;
if(j<=0)continue;
++ans;
hs.insert(j);
}
cout<<ans<<endl;
}
int main(){
int _;scanf("%d",&_);
while(_--){
cin>>a>>b; p=a*b;
if(p<9) {small();continue;}
ll t=ll(sqrt(p-2.0));while((t+1ll)*(t+1ll)<=p)++t;
ll ans=(t-1)*2;
if(a<t)--ans;
if(b<t)--ans;
if(t*t!=p){
ll x=p/t;
assert(x>=t && x<=t+2);
if(x==t){
if(t*t<p && t!=a && t!=b) ++ans;
} else if(x==t+1){
if(t*(t+1)==p){
if(t!=a && t!=b) ++ans;
} else{
if(a==t){
if(b!=t)++ans;
} else if(a==t+1){
++ans;
} else if(b==t || b==t+1){
++ans;
} else ans+=2;
}
} else {
assert(t*(t+2)==p);
if(a==t){
if(b!=t)++ans;
} else if(a==t+1){
++ans;
} else if(b==t || b==t+1){
++ans;
} else ans+=2;
}
}
cout<<ans<<endl;
}
return 0;
}
Submission Info
Submission Time
2018-04-24 11:47:22+0900
Task
D - Worst Case
User
LiMingHao
Language
C++14 (GCC 5.4.1)
Score
700
Code Size
3848 Byte
Status
AC
Exec Time
1 ms
Memory
256 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:76:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
int _;scanf("%d",&_);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
700 / 700
Status
Set Name
Test Cases
Sample
s1.txt
All
01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, s1.txt
Case Name
Status
Exec Time
Memory
01.txt
AC
1 ms
256 KB
02.txt
AC
1 ms
256 KB
03.txt
AC
1 ms
256 KB
04.txt
AC
1 ms
256 KB
05.txt
AC
1 ms
256 KB
06.txt
AC
1 ms
256 KB
07.txt
AC
1 ms
256 KB
08.txt
AC
1 ms
256 KB
09.txt
AC
1 ms
256 KB
10.txt
AC
1 ms
256 KB
11.txt
AC
1 ms
256 KB
s1.txt
AC
1 ms
256 KB