Submission #1312807
Source Code Expand
#include <cstdio> #include <cstdlib> #include <algorithm> #include <vector> #include <cstring> #include <functional> #include <set> #include <map> #include <cmath> #include <string> #include <queue> using namespace std; typedef pair <int,int> P; typedef long long int ll; int getHigh(ll A) { if(A==0) return -1; int ret=0; while(1) { A/=2; if(A==0) break; ret++; } return ret; } int main() { ll A,B; scanf("%lld %lld",&A,&B); if(A==B) { puts("1"); return 0; } ll ret=0; while(A>0) { int a=getHigh(A),b=getHigh(B); if(a==b) { A-=1LL<<a; B-=1LL<<b; } else break; } int b=getHigh(B); ret+=(1LL<<b)-A; ll T=B-(1LL<<b); int t=getHigh(T)+1; //printf("%lld %lld : %d %d\n",A,B,b,t); ll bt=0; for(int i=0;i<t;i++) { if(A%2==1) bt|=1LL<<i; A/=2; b--; } ll add=(1LL<<b)-A; if(A>0) { add++; ret-=bt; } ret+=add*(1LL<<t); printf("%lld\n",ret); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - A or...or B Problem |
User | yutaka1999 |
Language | C++14 (GCC 5.4.1) |
Score | 900 |
Code Size | 983 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 128 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:32:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%lld %lld",&A,&B); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 900 / 900 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 50.txt, 51.txt, 52.txt, 53.txt, 54.txt, 55.txt, 56.txt, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 1 ms | 128 KB |
02.txt | AC | 1 ms | 128 KB |
03.txt | AC | 1 ms | 128 KB |
04.txt | AC | 1 ms | 128 KB |
05.txt | AC | 1 ms | 128 KB |
06.txt | AC | 1 ms | 128 KB |
07.txt | AC | 1 ms | 128 KB |
08.txt | AC | 1 ms | 128 KB |
09.txt | AC | 1 ms | 128 KB |
10.txt | AC | 1 ms | 128 KB |
11.txt | AC | 1 ms | 128 KB |
12.txt | AC | 1 ms | 128 KB |
13.txt | AC | 1 ms | 128 KB |
14.txt | AC | 1 ms | 128 KB |
15.txt | AC | 1 ms | 128 KB |
16.txt | AC | 1 ms | 128 KB |
17.txt | AC | 1 ms | 128 KB |
18.txt | AC | 1 ms | 128 KB |
19.txt | AC | 1 ms | 128 KB |
20.txt | AC | 1 ms | 128 KB |
21.txt | AC | 1 ms | 128 KB |
22.txt | AC | 1 ms | 128 KB |
23.txt | AC | 1 ms | 128 KB |
24.txt | AC | 1 ms | 128 KB |
25.txt | AC | 1 ms | 128 KB |
26.txt | AC | 1 ms | 128 KB |
27.txt | AC | 1 ms | 128 KB |
28.txt | AC | 1 ms | 128 KB |
29.txt | AC | 1 ms | 128 KB |
30.txt | AC | 1 ms | 128 KB |
31.txt | AC | 1 ms | 128 KB |
32.txt | AC | 1 ms | 128 KB |
33.txt | AC | 1 ms | 128 KB |
34.txt | AC | 1 ms | 128 KB |
35.txt | AC | 1 ms | 128 KB |
36.txt | AC | 1 ms | 128 KB |
37.txt | AC | 1 ms | 128 KB |
38.txt | AC | 1 ms | 128 KB |
39.txt | AC | 1 ms | 128 KB |
40.txt | AC | 1 ms | 128 KB |
41.txt | AC | 1 ms | 128 KB |
42.txt | AC | 1 ms | 128 KB |
43.txt | AC | 1 ms | 128 KB |
44.txt | AC | 1 ms | 128 KB |
45.txt | AC | 1 ms | 128 KB |
46.txt | AC | 1 ms | 128 KB |
47.txt | AC | 1 ms | 128 KB |
48.txt | AC | 1 ms | 128 KB |
49.txt | AC | 1 ms | 128 KB |
50.txt | AC | 1 ms | 128 KB |
51.txt | AC | 1 ms | 128 KB |
52.txt | AC | 1 ms | 128 KB |
53.txt | AC | 1 ms | 128 KB |
54.txt | AC | 1 ms | 128 KB |
55.txt | AC | 1 ms | 128 KB |
56.txt | AC | 1 ms | 128 KB |
s1.txt | AC | 1 ms | 128 KB |
s2.txt | AC | 1 ms | 128 KB |
s3.txt | AC | 1 ms | 128 KB |