Submission #3046005
Source Code Expand
#include<cstdio>
#include<cstring>
#include<cmath>
#include<bitset>
#include<iostream>
#include<algorithm>
#include<string>
#include<utility>
#include<tuple>
#include<vector>
#include<list>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<numeric>
#include<functional>
#include<iomanip>
#include<random>
#define IOS ios::sync_with_stdio(false),cin.tie(0)
#define REP(i,n) for(int i = 0;i < n;i++)
#define FOR(i,a,b) for(int i = a;i < b;i++)
#define MEM(a,b) memset(a,b,sizeof(a))
#define ALL(x) (x).begin(),(x).end()
#define LMAX 9223372036854775807
#define LMIN -9223372036854775808
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ull, ull> UP;
typedef tuple<int, int, int> T;
struct UnionFind {
vector<int> data;
UnionFind(int size) : data(size, -1) {}
void unionSet(int x, int y) {
x = root(x), y = root(y);
if (x != y) {
if (data[y] < data[x])swap(x, y);
data[x] += data[y]; data[y] = x;
}
}
bool findSet(int x, int y) {
return root(x) == root(y);
}
int root(int x) {
return data[x] < 0 ? x : data[x] = root(data[x]);
}
int size(int x) {
return -data[root(x)];
}
};
ll gcd(ll a, ll b) {
if (a < b)swap(a, b);
int k = a % b;
if (k == 1)return 1;
if (k == 0)return b;
int ans = gcd(b, k);
return ans;
}
ll digisum(ll a) {
int sum = 0;
while (a) {
sum += a % 10;
a /= 10;
}
return sum;
}
ll countpow(ll a, ll b) {
int ans = 0;
if (b == 0)return -1;
while (1) {
if (a % b == 0) {
a /= b;
ans++;
}
else break;
}
return ans;
}
int main() {
IOS;
int n;
cin >> n;
ll ans = 1145148101919;
REP(i, n) {
ll a;
cin >> a;
a = countpow(a, 2);
if (a < ans)ans = a;
}
cout << ans << endl;
}
Submission Info
Submission Time |
|
Task |
B - Shift only |
User |
jgvt5ti |
Language |
C++14 (GCC 5.4.1) |
Score |
200 |
Code Size |
1845 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
200 / 200 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample1.txt, sample2.txt, sample3.txt |
All |
sample1.txt, sample2.txt, sample3.txt, 1.txt, 2.txt, 3.txt, 4.txt, 5.txt, 6.txt, 7.txt, sample1.txt, sample2.txt, sample3.txt |
Case Name |
Status |
Exec Time |
Memory |
1.txt |
AC |
1 ms |
256 KB |
2.txt |
AC |
1 ms |
256 KB |
3.txt |
AC |
1 ms |
256 KB |
4.txt |
AC |
1 ms |
256 KB |
5.txt |
AC |
1 ms |
256 KB |
6.txt |
AC |
1 ms |
256 KB |
7.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 |