Submission #2860707
Source Code Expand
# include <iostream> # include <algorithm> # include <vector> # include <string> # include <set> # include <map> # include <cmath> # include <iomanip> # include <functional> # include <utility> # include <stack> # include <queue> # include <list> # include <bitset> # include <complex> #include<limits.h> #include<unordered_map> #include<unordered_set> #include<deque> #include<cstdio> const int mod = 1000000007; typedef long long int ll; #define rep(i,n) for(int i=0;i<n;++i) #define ALL(x) x.begin(),x.end(); #define pp pair<ll,ll> const int INF = 1LL << 30; const ll LLINF = 1LL << 60; using namespace std; int main() { ll a, b, c, ct = 0; cin >> a >> b >> c; if (a == b && b == c)ct = (a%2==0?-1:0); else { while (a%2+b%2+c%2 == 0) { ++ct; ll aa = a, bb = b, cc = c; a = bb / 2 + cc / 2; b = aa / 2 + cc / 2; c = aa / 2 + bb / 2; } } cout << ct << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Cookie Exchanges |
User | mukadenodaiou |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 941 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt, sample3.txt |
All | sample1.txt, sample2.txt, sample3.txt, in1.txt, in10.txt, in11.txt, in2.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt, sample3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in1.txt | AC | 1 ms | 256 KB |
in10.txt | AC | 1 ms | 256 KB |
in11.txt | AC | 1 ms | 256 KB |
in2.txt | AC | 1 ms | 256 KB |
in3.txt | AC | 1 ms | 256 KB |
in4.txt | AC | 1 ms | 256 KB |
in5.txt | AC | 1 ms | 256 KB |
in6.txt | AC | 1 ms | 256 KB |
in7.txt | AC | 1 ms | 256 KB |
in8.txt | AC | 1 ms | 256 KB |
in9.txt | AC | 1 ms | 256 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |