FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
Competitive-Programming/AdditionTesting.cpp at master · KevinMathewT/Competitive-Programming · GitHub
KevinMathewT
/
Competitive-Programming
Public
Notifications
You must be signed in to change notification settings
Fork
3
Star
3
Code
Issues
0
Pull requests
1
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
Competitive-Programming
/
AdditionTesting.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
100 lines (84 loc) · 1.91 KB
Breadcrumbs
Competitive-Programming
/
AdditionTesting.cpp
Copy path
File metadata and controls
100 lines (84 loc) · 1.91 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
#
include
<
bits/stdc++.h
>
using
namespace
std
;
typedef
long
long
ll;
typedef
double
ld;
#
define
F
first
#
define
S
second
template
<
class
T
> ostream&
operator
<<(ostream &os, vector<T> V) {
os <<
"
[
"
;
for
(
auto
v : V) os << v <<
"
"
;
os <<
"
]
"
;
return
os;
}
template
<
class
T
> ostream&
operator
<<(ostream &os, set<T> S){
os <<
"
{
"
;
for
(
auto
s:S) os<<s<<
"
"
;
return
os<<
"
}
"
;
}
template
<
class
L
,
class
R
> ostream&
operator
<<(ostream &os, pair<L,R> P) {
return
os <<
"
(
"
<< P.
first
<<
"
,
"
<< P.
second
<<
"
)
"
;
}
template
<
class
L
,
class
R
> ostream&
operator
<<(ostream &os, map<L,R> M) {
os <<
"
{
"
;
for
(
auto
m:M) os<<
"
(
"
<<m.
F
<<
"
:
"
<<m.
S
<<
"
)
"
;
return
os<<
"
}
"
;
}
//
Kevin Mathew T
//
Birla Institute of Technology, Mesra
//
GitHub - https://github.com/KevinMathewT
//
CodeForces - https://codeforces.com/profile/KevinMathew
//
CodeChef - https://www.codechef.com/users/KevinMathew
//
HackerRank - https://www.hackerrank.com/KevinMathew?
void
printBin
(ll x){
string s =
"
"
;
while
(x >
0
){
s.
push_back
(
'
0
'
+ (x %
2
));
x /=
2
;
}
reverse
(s.
begin
(), s.
end
());
cout << s;
}
ll
func
(ll a, ll b){
cout << a <<
'
'
<< b <<
"
\n
"
;
printBin
(a);
cout <<
'
\n
'
;
printBin
(b);
cout <<
"
\n
"
;
ll t =
0
;
while
(b >
0
){
t++;
ll u = a ^ b;
ll v = a & b;
a = u;
b =
2
* v;
cout << a <<
'
'
<< b <<
"
\n
"
;
printBin
(a);
cout <<
'
'
;
printBin
(b);
cout <<
"
\n
"
;
}
return
t;
}
void
solve
(){
ll mx =
0
, l, r;
ll x =
0
, y =
0
;
//
for(ll i=x;i<x+3000;i++)
//
for(ll j=y;j<y+3000;j++)
//
if(func(i, j) > mx){
//
mx = max(mx, func(i, j));
//
l = i; r = j;
//
}
cout <<
func
(
2999
,
1097
) <<
"
\n
"
;
//
cout << l << ' ' << r << "\n";
cout << mx <<
"
\n
"
;
}
int
main
()
{
freopen
(
"
input.txt
"
,
"
r
"
, stdin);
//
Comment
freopen
(
"
output.txt
"
,
"
w
"
, stdout);
//
this out.
ios::sync_with_stdio
(
false
);
//
Not
cin.
tie
(
NULL
);
//
this.
cout.
tie
(
0
);
//
or this.
solve
();
return
0
;
}
Back
|
FazBrowse Home
|
New Git URL