Submission #308296

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
308296	2020-09-30T20:41:31 Z	MatheusLealV	Strongbox (POI11_sej)	C++17	0 / 100	575 ms	12372 KB

#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
std::mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
using namespace std;

#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
ll mod = (1000000007LL);
inline ll Mod(ll a, ll b){return (a%b);}
inline ll poww(ll a, ll b){ll res = 1;while (b > 0){if(b & 1) res = (res * a)%mod;a = (a * a)%mod;b >>= 1;}return res;}
ll gcd (ll a, ll b) { while (b) { a %= b,swap(a, b);}return a;}
void read(vector<int> &w, int n){w.resize(n);for(int i = 0; i < n; i++) cin>>w[i];}
void print(vector<int> &w){for(int i =0; i < sz(w); i++){if(i == sz(w) - 1) cout<<w[i]<<"\n";else cout<<w[i]<<" ";}}
int prodmod(vector<int> w);
int summod(vector<int> w);
///CUIDADO COM MAXN
#define N 300050

int n, m, q, k, v[N], ans;
// vector<int> grafo[N];
pii w[N];
string s;


int32_t main(){
	ios::sync_with_stdio(false); cin.tie(0);
	cin>>n>>k;
	// set<int> caras;
	vector<int> primes;
	for(int i = 1; i < k; i++){
		cin>>v[i];
		int x = v[i];
		for(int j = 2; j*j <= sqrt(x); j++){
			int qtd = 0;
			while(x % j == 0){
				x /= j;
				qtd++;
			}
			if(qtd) primes.pb(j);
		}

		if(x > 1) primes.pb(x);
	}
	cin>>v[k];
	sort(all(primes));
	primes.erase(unique(all(primes)), primes.end());

	int x = v[k], menorfat = (int)(2e18);
	for(int j = 2; j*j <= sqrt(x); j++){
		int qtd = 0;
		while(x % j == 0){
			x /= j;
			qtd++;
		}
		if(qtd and !binary_search(all(primes), j)){
			// primes.pb(j);
			menorfat=min(menorfat, j);
		}
	}

	if(x > 1 and !binary_search(all(primes), x)) menorfat=min(menorfat, x);

	cout<<n/menorfat<<"\n";	
}
/*
    CUIDADO COM MAXN, MOD, OVERFLOW 
    >Colocar (>DEFINE INT LONG LONG<) no inicio do template
    >mod = (1e9 + 7), por padrao (NAO ESQUECER DE ALTERAR)
    >NAO ESQUECER DEFINE INT LONG LONG
    > N = 1 ? 
*/
int summod(vector<int> w){int curr=0;for(int i=0;i<sz(w); i++){curr = (curr+w[i])%mod;if(curr<0)curr+=mod;}return curr;}
int prodmod(vector<int> w){int curr = 1;
for(int i = 0; i < sz(w); i++){if(w[i] >= mod) w[i] %= mod;curr = (curr * w[i]) % mod;if(curr < 0) curr += mod;}return curr;}

Subtask #1
0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Incorrect	1 ms	384 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #2
0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	384 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #3
0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Incorrect	1 ms	384 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #4
0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	400 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Incorrect	1 ms	384 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #6
0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	2 ms	384 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #7
0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	4 ms	384 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #8
0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	2 ms	384 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #9
0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	2 ms	384 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #10
0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	5 ms	512 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #11
0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	116 ms	6376 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #12
0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	575 ms	11492 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #13
0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	440 ms	12000 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #14
0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	289 ms	12372 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Submission #308296

Compilation message