text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb emplace_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
const int32_t inf = 1001001001;
const int64_t infll = 1001001001001001001ll;
const int dx[] = {0, -1, 1, 0, -1, 1, -1, 1}, dy[] = {-1, 0, 0, 1, -1, -1, 1, 1};
template <typename T> using vector2d = vector<vector<T>>;
// clang-format off
template <typename T> void sort(vector<T> &v) { sort(all(v)); }
// ostream &operator<<(ostream &os, __int128_t value) { if (ostream::sentry(os)) { __uint128_t tmp = value < 0 ? -value : value; char buffer[64]; char *d = end(buffer); do { --d; *d = "0123456789"[tmp % 10]; tmp /= 10; } while (tmp != 0); if (value < 0) { --d; *d = '-'; } int len = end(buffer) - d; if (os.rdbuf()->sputn(d, len) != len) { os.setstate(ios_base::badbit); }} return os; }
// istream &operator>>(istream &is, __int128_t &value) { string in; is >> in; value = 0; for (const char &c : in) { if ('0' <= c && c <= '9') value = 10 * value + (c - '0'); } if (in[0] == '-') value *= -1; return is; }
// ostream &operator<<(ostream &os, __uint128_t value) { if (ostream::sentry(os)) { char buffer[64]; char *d = end(buffer); do { --d; *d = "0123456789"[value % 10]; value /= 10; } while (value != 0); int len = end(buffer) - d; if (os.rdbuf()->sputn(d, len) != len) { os.setstate(ios_base::badbit); }} return os; }
// istream &operator>>(istream &is, __uint128_t &value) { string in; is >> in; value = 0; for (const char &c : in) { if ('0' <= c && c <= '9') value = 10 * value + (c - '0'); } return is; }
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) { os << v[0]; for (int i = 1; i < v.size(); ++i) os << " " << v[i]; return os; }
template <typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &in : v) is >> in; return is; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p) { os << p.fs << " " << p.sc; return os; }
template <typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.fs >> p.sc; return is; }
struct IoSetup { IoSetup(){ cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(10); cerr << fixed << setprecision(10); } } iosetup;
inline int64_t in() { int64_t x = 0; cin >> x; return x; }
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
// clang-format on
vector<int> eratosthenes(int n) {
vector<int> res, p(n + 1, 1);
p[0] = p[1] = 0;
for (int i = 2; i * i <= n; ++i) {
if (p[i]) {
for (int j = 2 * i; j <= n; j += i) {
p[j] = 0;
}
}
}
for (int i = 0; i <= n; ++i) {
if (p[i]) res.push_back(i);
}
// return res;
return p;
}
const int mod = 1e9 + 7;
vector<int> prime = eratosthenes(1000000);
int n;
vector<int> q;
int dp[101010][2];
int dfs(int idx = 1, int pre = 0) {
if (idx > q.size()) return 0;
if (idx == q.size()) {
return 1;
}
int &res = dp[idx][pre + 1 == idx];
if (~res) return res;
res = 0;
if (prime[q[idx]] && q[pre] < q[idx]) {
res += dfs(idx + 2, idx);
res %= mod;
res += dfs(idx + 1, idx);
res %= mod;
}
return res;
}
signed main(int argc, char *argv[]) {
memset(dp, -1, sizeof dp);
cin >> n;
q = vector<int>(n + 1);
for (int i = 1; i <= n; ++i) cin >> q[i];
cout << dfs() << endl;
}
|
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <errno.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <cstdlib>
#include <unordered_map>
using namespace std;
#define Ma_PI 3.141592653589793
#define eps 0.00000001
#define LONG_INF 3000000000000000000
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define REP(i,n) for(long long i = 0;i < n;++i)
#define seg_size 524288
using namespace std;
long long dp[300000][2] = {};
int sosuu(int now) {
for (int q = 2; q <= sqrt(now); ++q) {
if (now%q == 0) return 0;
}
return 1;
}
int main() {
int n;
cin >> n;
vector<int> a;
a.push_back(0);
REP(i, n) {
int b;
cin >> b;
a.push_back(b);
}
dp[0][0] = 1;
dp[1][1] = -1;
n++;
for (int i = 1; i < n; ++i) {
if (sosuu(a[i]) == 1) {
//back 2
if (sosuu(a[i-1]) == 1&&a[i - 1] < a[i]) {
dp[i][0] += dp[i - 1][0];
}
if (i >= 2 && sosuu(a[i - 2]) == 1 && a[i - 2] < a[i]) {
dp[i][0] += dp[i - 1][1];
}
dp[i][0] %= MAX_MOD;
}
dp[i][1] += dp[i - 1][0];
dp[i][1] %= MAX_MOD;
}
cout << (dp[n - 1][0] + dp[n - 1][1]) % MAX_MOD << endl;
return 0;
}
|
#include<algorithm>
#include<iostream>
#include<vector>
using namespace std;
typedef long long lint;
typedef vector<int>vi;
typedef pair<int,int>pii;
#define rep(i,n)for(int i=0;i<(int)(n);++i)
const lint mod=1e9+7;
const int K=1e6+10;
int pr[K];
void init(){
rep(i,K)if(i>=2)pr[i]=1;
for(int i=2;i<K;++i){
if(!pr[i])continue;
for(int j=2;j*i<K;++j)pr[i*j]=0;
}
}
const int N=110000;
lint dp[N];
int main(){
init();
int n;
cin>>n;
vi q(n+1);
rep(i,n)cin>>q[i];
q[n]=K;
dp[n]=1;
for(int i=n-1;i>=0;--i){
if(pr[q[i]]&&q[i]<q[i+1]){
dp[i]=(dp[i]+dp[i+1])%mod;
}
if(i<n-1&&pr[q[i]]&&q[i+1]>=2&&q[i]<q[i+2]){
dp[i]=(dp[i]+dp[i+2])%mod;
}
}
cout<<dp[0]<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
typedef pair<int,int> P;
typedef pair<int,P> PP;
const int N=14;
int dp1[N][1001],c[N][N],dp2[1<<N][N],dp3[2][1<<(N/2+1)][1001],dp[1<<N][1001],ans;
vector<PP> a[N+1];
int main() {
int A,B,n;
cin >> n >> A >> B;
for(int k=0; k<n; k++) {
fill(dp1[k],dp1[k]+B+1,-(1<<30));
dp1[k][0]=0;
int m;
cin >> m;
for(int i=0; i<m; i++) {
PP p;
cin >> p.S.F >> p.F >> p.S.S;
int t=1;
while(p.S.S) {
do {
for(int j=B; j>=0; j--) {
if(j+p.S.F*t<=B) dp1[k][j+p.S.F*t]=max(dp1[k][j+p.S.F*t],dp1[k][j]+p.F*t);
}
p.S.S-=t;
} while(p.S.S%(t*2));
t*=2;
}
}
for(int i=0; i<B; i++) dp1[k][i+1]=max(dp1[k][i+1],dp1[k][i]);
}
for(int i=0; i<n; i++)for(int j=0; j<n; j++) cin >> c[i][j];
for(int k=0;k<n;k++)for(int i=0;i<n;i++)for(int j=0;j<n;j++)c[i][j]=min(c[i][j],c[i][k]+c[k][j]);
for(int t=0;t<(1<<n);t++)for(int i=0;i<n;i++) dp2[t][i]=1<<30;
for(int i=0; i<n; i++) dp2[1<<i][i]=c[0][i];
for(int t=1; t<(1<<n); t++) {
for(int i=0; i<n; i++) {
if(!(t&(1<<i))) continue;
for(int j=0; j<n; j++) {
if(t&(1<<j)) continue;
dp2[t|(1<<j)][j]=min(dp2[t|(1<<j)][j],dp2[t][i]+c[i][j]);
}
}
}
for(int t=0;t<(1<<(n/2+n%2));t++)for(int i=0;i<=B;i++)dp3[0][t][i]=dp3[1][t][i]=-(1<<30);
for(int l=0; l<2; l++) {
dp3[l][0][0]=0;
for(int t=0; t<(1<<(n/2+n%2*l)); t++) {
for(int i=0; i<n/2+n%2*l; i++) {
if(t&(1<<i)) continue;
for(int j=B; j>=0; j--) {
for(int k=B-j; k>=0; k--) {
dp3[l][t|(1<<i)][j+k]=max(dp3[l][t|(1<<i)][j+k],dp3[l][t][j]+dp1[i+n/2*l][k]);
}
}
}
for(int i=0; i<B; i++) dp3[l][t][i+1]=max(dp3[l][t][i+1],dp3[l][t][i]);
}
}
for(int t=0;t<(1<<n);t++)for(int i=0;i<=B;i++)dp[t][i]=-(1<<30);
for(int t=0;t<(1<<(n/2));t++) {
if(n>1&&t%2==0) continue;
for(int s=0; s<(1<<(n/2+n%2)); s++) {
int C=max(0,A-dp2[t|(s<<(n/2))][0]),D=min(B,C);
for(int i=0; i<=D; i++)ans=max(ans,dp3[0][t][i]+dp3[1][s][D-i]);
}
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 99999999999999999
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 15
struct Data{
Data(int arg_price,int arg_value,int arg_num){
price = arg_price;
value = arg_value;
num = arg_num;
}
int price,value,num;
};
struct Info{
int num_item;
vector<Data> V;
};
int N,X,Y;
int POW[SIZE];
int min_dist[SIZE][SIZE];
int TSP[1 << 14][SIZE];
int dp_each[SIZE][305][1005],dp_each2[SIZE][1005];
int dp_A[1 << 7][1005],dp_B[1 << 7][1005];
Info info[SIZE];
int main(){
POW[0] = 1;
for(int i = 1; i < SIZE; i++){
POW[i] = POW[i-1]*2;
}
scanf("%d %d %d",&N,&X,&Y);
int price,value,num;
for(int i = 0; i < N; i++){
scanf("%d",&info[i].num_item);
for(int k = 0; k < info[i].num_item; k++){
scanf("%d %d %d",&price,&value,&num);
info[i].V.push_back(Data(price,value,num));
}
}
for(int i = 0; i < N; i++){
for(int k = 0; k < N; k++){
scanf("%d",&min_dist[i][k]);
}
}
for(int i = 0; i < N; i++){ //14
for(int k = 0; k <= info[i].num_item; k++){
for(int p = 0; p <= Y; p++){
dp_each[i][k][p] = -BIG_NUM;
}
}
for(int k = 0; k <= Y; k++){
dp_each2[i][k] = -BIG_NUM;
}
dp_each[i][0][0] = 0;
dp_each2[i][0] = 0;
for(int k = 0; k < info[i].num_item; k++){ //300
for(int p = 0; p <= Y; p++){
dp_each[i][k+1][p] = dp_each[i][k][p];
}
int num = info[i].V[k].num;
int mult;
for(int p = 1; num > 0; p *= 2){
mult = min(p,num);
for(int w = Y; w-mult*info[i].V[k].price >= 0; w--){
if(dp_each[i][k+1][w-mult*info[i].V[k].price] == -BIG_NUM)continue;
dp_each[i][k+1][w] = max(dp_each[i][k+1][w],
dp_each[i][k+1][w-mult*info[i].V[k].price]+mult*info[i].V[k].value);
dp_each2[i][w] = max(dp_each2[i][w],dp_each[i][k+1][w]);
}
num -= mult;
}
}
for(int k = 1; k <= Y; k++){
dp_each2[i][k] = max(dp_each2[i][k],dp_each2[i][k-1]);
}
}
if(N == 1){
printf("%d\n",dp_each2[0][Y]);
return 0;
}
//ワーシャルフロイド
for(int mid = 0; mid < N; mid++){
for(int start = 0; start < N; start++){
for(int goal = 0; goal < N; goal++){
min_dist[start][goal] = min(min_dist[start][goal],min_dist[start][mid]+min_dist[mid][goal]);
}
}
}
//TSP
for(int state = 0; state < POW[N]; state++){
for(int town = 0; town < N; town++){
TSP[state][town] = BIG_NUM;
}
}
TSP[1][0] = 0;
for(int state = 1; state < POW[N];state++){
for(int town = 0; town < N; town++){
if(TSP[state][town] == BIG_NUM)continue;
for(int loop = 0; loop < N; loop++){
if(state & (1 << loop))continue;
int next_state = state+POW[loop];
int next_dist = TSP[state][town]+min_dist[town][loop];
TSP[next_state][loop] = min(TSP[next_state][loop],next_dist);
}
}
}
vector<int> A,B;
for(int i = 0; i < N/2; i++){
A.push_back(i);
}
for(int i = N/2; i < N; i++){
B.push_back(i);
}
for(int i = 0; i < POW[A.size()]; i++){
for(int k = 0; k <= Y; k++){
dp_A[i][k] = -BIG_NUM;
}
}
dp_A[0][0] = 0;
for(int state = 0; state < POW[A.size()]; state++){
for(int i = 0; i <= Y; i++){
if(dp_A[state][i] == -BIG_NUM)continue;
for(int loop = 0; loop < A.size(); loop++){
if(state & (1 << loop))continue;
for(int k = 0; k <= Y; k++){
if(i+k > Y)break;
int next_state = state+POW[loop];
int next_value = dp_A[state][i]+dp_each2[A[loop]][k];
dp_A[next_state][i+k] = max(dp_A[next_state][i+k],next_value);
}
}
}
for(int i = 1; i <= Y; i++){
dp_A[state][i] = max(dp_A[state][i],dp_A[state][i-1]);
}
}
for(int i = 0; i < POW[B.size()]; i++){
for(int k = 0; k <= Y; k++){
dp_B[i][k] = -BIG_NUM;
}
}
dp_B[0][0] = 0;
for(int state = 0; state < POW[B.size()]; state++){
for(int i = 0; i <= Y; i++){
if(dp_B[state][i] == -BIG_NUM)continue;
for(int loop = 0; loop < B.size(); loop++){
if(state & (1 << loop))continue;
for(int k = 0; k <= Y; k++){
if(i+k > Y)break;
int next_state = state+POW[loop];
int next_value = dp_B[state][i]+dp_each2[B[loop]][k];
dp_B[next_state][i+k] = max(dp_B[next_state][i+k],next_value);
}
}
}
for(int i = 1; i <= Y; i++){
dp_B[state][i] = max(dp_B[state][i],dp_B[state][i-1]);
}
}
int ans = 0;
for(int state_A = 1; state_A < POW[A.size()]; state_A++){
int num_A = 0;
for(int loop = 0; loop < A.size(); loop++){
if(state_A & (1 << loop)){
num_A += POW[A[loop]];
}
}
for(int state_B = 0; state_B < POW[B.size()]; state_B++){
int num_B = 0;
for(int loopB = 0; loopB < B.size(); loopB++){
if(state_B & (1 << loopB)){
num_B += POW[B[loopB]];
}
}
int all_state = num_A+num_B;
int path_cost = BIG_NUM;
for(int i = 0; i < N; i++){
if(!(POW[i]&all_state))continue;
path_cost = min(path_cost,TSP[all_state][i]+min_dist[i][0]);
}
int limit = Y;
if(X-Y < path_cost){
limit = Y-(path_cost-(X-Y));
}
for(int budget_A = 0; budget_A <= limit; budget_A++){
int budget_B = limit-budget_A;
ans = max(ans,dp_A[state_A][budget_A]+dp_B[state_B][budget_B]);
}
}
}
printf("%d\n",ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 29;
int N, X, Y, G[14][14];
int tsp[1 << 14][14];
vector< tuple< int, int, int > > vs[14];
int dp1[1 << 7][1001];
int dp2[1 << 7][1001];
int main()
{
cin >> N >> X >> Y;
for(int i = 0; i < N; i++) {
int K;
cin >> K;
for(int j = 0; j < K; j++) {
int a, b, c;
cin >> a >> b >> c;
vs[i].emplace_back(a, b, c);
}
}
for(int i = 0; i < N; i++) {
for(int j = 0; j < N; j++) {
cin >> G[i][j];
}
}
fill_n(*tsp, (1 << 14) * 14, INF);
for(int i = 0; i < N; i++) tsp[1 << i][i] = G[0][i];
for(int i = 0; i < (1 << N); i++) {
for(int j = 0; j < N; j++) {
for(int k = 0; k < N; k++) {
tsp[i | (1 << k)][k] = min(tsp[i | (1 << k)][k], tsp[i][j] + G[j][k]);
}
}
}
vector< int > st1, st2;
int mid = N / 2;
for(int i = 0; i < (1 << mid); i++) st1.emplace_back(i);
for(int i = 0; i < (1 << (N - mid)); i++) st2.emplace_back(i);
for(int i = 0; i < mid; i++) {
for(auto &p : vs[i]) {
int a, b, c;
tie(a, b, c) = p;
for(int k = 0; c > 0; k++) {
int key = min(c, (int) (1 << k));
c -= key;
for(int j = 1000; j >= key * a; j--) {
dp1[1 << i][j] = max(dp1[1 << i][j], dp1[1 << i][j - key * a] + key * b);
}
}
}
for(int j = 1; j <= 1000; j++) {
dp1[1 << i][j] = max(dp1[1 << i][j], dp1[1 << i][j - 1]);
}
}
for(int i = 0; i < N - mid; i++) {
for(auto &p : vs[i + mid]) {
int a, b, c;
tie(a, b, c) = p;
for(int k = 0; c > 0; k++) {
int key = min(c, (int) (1 << k));
c -= key;
for(int j = 1000; j >= key * a; j--) {
dp2[1 << i][j] = max(dp2[1 << i][j], dp2[1 << i][j - key * a] + key * b);
}
}
}
for(int j = 1; j <= 1000; j++) {
dp2[1 << i][j] = max(dp2[1 << i][j], dp2[1 << i][j - 1]);
}
}
sort(begin(st1), end(st1), [&](int a, int b)
{
return (__builtin_popcount(a) < __builtin_popcount(b));
});
sort(begin(st2), end(st2), [&](int a, int b)
{
return (__builtin_popcount(a) < __builtin_popcount(b));
});
for(auto &i : st1) {
if(__builtin_popcount(i) > 1) {
int idx = -1;
for(int j = 0; j < mid; j++) {
if((i >> j) & 1) {
idx = j;
break;
}
}
// cout << idx << endl;
int bit = i ^(1 << idx);
for(int j = 0; j <= 1000; j++) {
dp1[i][j] = dp1[bit][j];
}
for(auto &p : vs[idx]) {
int a, b, c;
tie(a, b, c) = p;
for(int k = 0; c > 0; k++) {
int key = min(c, (int) (1 << k));
c -= key;
for(int j = 1000; j >= key * a; j--) {
dp1[i][j] = max(dp1[i][j], dp1[i][j - key * a] + key * b);
}
}
}
for(int j = 1; j <= 1000; j++) {
dp1[i][j] = max(dp1[i][j], dp1[i][j - 1]);
}
}
}
for(auto &i : st2) {
if(__builtin_popcount(i) > 1) {
int idx = -1;
for(int j = 0; j < N - mid; j++) {
if((i >> j) & 1) {
idx = j;
break;
}
}
// cout << idx << endl;
int bit = i ^(1 << idx);
for(int j = 0; j <= 1000; j++) {
dp2[i][j] = dp2[bit][j];
}
for(auto &p : vs[idx + mid]) {
int a, b, c;
tie(a, b, c) = p;
for(int k = 0; c > 0; k++) {
int key = min(c, (int) (1 << k));
c -= key;
for(int j = 1000; j >= key * a; j--) {
dp2[i][j] = max(dp2[i][j], dp2[i][j - key * a] + key * b);
}
}
}
for(int j = 1; j <= 1000; j++) {
dp2[i][j] = max(dp2[i][j], dp2[i][j - 1]);
}
}
}
int ret = 0;
for(auto &s : st1) {
for(auto &t : st2) {
int bit = (t << mid) | s;
int rest = X - tsp[bit][0];
if(rest < 0) continue;
int cost = min(rest, Y);
for(int i = 0; i <= cost; i++) {
ret = max(ret, dp1[s][i] + dp2[t][cost - i]);
}
}
}
cout << ret << endl;
} |
#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<unordered_map>
#include<array>
#include<map>
#include<iomanip>
//<< setprecision(5)
using namespace std;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
#define dme cout<<-1<<endl;return 0
const int mod=1000000007;
const int big=1e9+10;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-7;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
llint lcm(llint a,llint b){return a/gcd(a,b)*b;}
int main(void){
int i,j,l,n,X,Y;cin>>n>>X>>Y;
int ido[14][14];
static int zyu[16384][14];//????????????,??????????????£??????
array<vector<pair<int,int>>,14>daga;
for(i=0;i<n;i++){
int k;cin>>k;daga[i];
for(j=0;j<k;j++){
int a,b,c;cin>>a>>b>>c;
int ho=1;
while(ho<c){daga[i].pub(mp(a*ho,b*ho));c-=ho;ho*=2;}
daga[i].pub(mp(a*c,b*c));
}
}
for(i=0;i<14;i++){for(j=0;j<14;j++){ido[i][j]=big;}}
for(i=0;i<n;i++){for(j=0;j<n;j++){cin>>ido[i][j];}}
for(l=0;l<n;l++){
for(i=0;i<n;i++){for(j=0;j<n;j++){mineq(ido[i][j],ido[i][l]+ido[l][j]);}}
}
//wf
for(i=0;i<16384;i++){for(j=0;j<14;j++){zyu[i][j]=big;}}
zyu[0][0]=0;
for(i=0;i<16384;i++){//?????????
for(j=0;j<14;j++){//????????????
if((i&(1<<j))==0){continue;}//????????????????????????
for(l=0;l<14;l++){//????????¢?´¢
//if(l!=0&&(i&(1<<l))==0){continue;}//????????????????????????
mineq(zyu[i][j],zyu[i-(1<<j)][l]+ido[l][j]);
}
}
}
//?????????dp??¨?????????
//for(i=0;i<64;i++){cout<<"de i="<<i<<" zyu[i][0]="<<zyu[i][0]<<endl;}
static array<int,1001> maesak[128];
static array<int,1001> atosak[128];
for(i=0;i<128;i++){for(j=0;j<=1000;j++){maesak[i][j]=0;atosak[i][j]=0;}}
for(i=1;i<128;i++){//?????§???????????????????§£???
int dco=0;//??????????????????
int ho=1;
while(ho<=i){ho*=2;dco++;}
ho/=2;dco--;
maesak[i]=maesak[i-ho];
for(l=0;l<daga[dco].size();l++){
int a=daga[dco][l].fir,b=daga[dco][l].sec;
for(j=1000-a;j>=0;j--){maxeq(maesak[i][j+a],maesak[i][j]+b);}
}
for(j=0;j<1000;j++){maxeq(maesak[i][j+1],maesak[i][j]);}//????§?????§£
}
for(i=1;i<128;i++){//????????§???????????????????§£???
int dco=7;//?????????????????? ??????????????§
int ho=1;
while(ho<=i){ho*=2;dco++;}
ho/=2;dco--;
atosak[i]=atosak[i-ho];
for(l=0;l<daga[dco].size();l++){
int a=daga[dco][l].fir,b=daga[dco][l].sec;
for(j=1000-a;j>=0;j--){maxeq(atosak[i][j+a],atosak[i][j]+b);}
}
for(j=0;j<1000;j++){maxeq(atosak[i][j+1],atosak[i][j]);}//????§?????§£
}
//?????????????????????????????????
int ans=0;
for(i=0;i<16384;i++){
int kae=min(Y,X-zyu[i][0]);//????????????
int mae=i&63;int ato=i>>7;
for(j=0;j<=kae;j++){
maxeq(ans,maesak[mae][j]+atosak[ato][kae-j]);
}
}
cout<<ans<<endl;
return 0;
} |
#include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
struct data{
int bit;
int cost;
int v;
data(){}
data(int vv,int bb,int cc){
v=vv;
cost=cc;
bit=bb;
}
bool operator<(const data &dat)const{
return cost>dat.cost;
}
};
int n,x,y;
int dp[1<<14][14];
int dp2[14][1001];
int dp3[1<<14][1001];
int dp4[1<<14][1001];
int tmp[1001][1001];
int tmp2[1001];
int tmp3[15][1001];
int dist[14][14];
int a[14][301],b[14][301],c[14][301];
void dijk(){
priority_queue<data> que;
for(int i=0;i<(1<<n);i++){
for(int j=0;j<n;j++){
dp[i][j]=100000;
}
}
dp[1][0]=0;
que.push(data(0,1,0));
while(que.size()){
data d=que.top();
que.pop();
if(dp[d.bit][d.v]<d.cost)continue;
for(int nec=0;nec<n;nec++){
int nbit=d.bit|(1<<nec);
int ncost=d.cost+dist[d.v][nec];
if(ncost<dp[nbit][nec]){
dp[nbit][nec]=ncost;
que.push(data(nec,nbit,ncost));
}
}
}
}
int main(void){
scanf("%d%d%d",&n,&x,&y);
for(int i=0;i<n;i++){
int k;
scanf("%d",&k);
for(int j=0;j<k;j++){
scanf("%d%d%d",&a[i][j],&b[i][j],&c[i][j]);
}
memset(tmp,0,sizeof(tmp));
for(int j=0;j<k;j++){
memset(tmp3,0,sizeof(tmp3));
for(int cs=0;cs<=y;cs++){
tmp3[0][cs]=tmp[j][cs];
}
int cnt2=0;
for(int ncs=0;ncs<=10;ncs++){
int cs=min(c[i][j],(int)(1<<ncs));
c[i][j]-=cs;
cnt2++;
for(int l=0;l<=y;l++){
tmp3[cnt2][l]=max(tmp3[cnt2][l],tmp3[cnt2-1][l]);
if(l+cs*a[i][j]>y)continue;
tmp3[cnt2][l+cs*a[i][j]]=max(tmp3[cnt2][l+cs*a[i][j]],tmp3[cnt2-1][l]+b[i][j]*cs);
}
}
for(int l=0;l<=y;l++){
tmp[j+1][l]=tmp3[cnt2][l];
}
}
for(int j=0;j<=y;j++){
dp2[i][j]=tmp[k][j];
}
for(int j=1;j<=y;j++){
dp2[i][j]=max(dp2[i][j],dp2[i][j-1]);
}
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
scanf("%d",&dist[i][j]);
}
}
dijk();
for(int i=0;i<n/2;i++){
for(int j=0;j<(1<<i);j++){
for(int k=0;k<=y;k++){
for(int l=k;l<=y;l++){
dp3[j|(1<<i)][l]=max(dp3[j|(1<<i)][l],dp3[j][k]+dp2[i][l-k]);
}
}
}
}
for(int i=0;i<(n+1)/2;i++){
for(int j=0;j<(1<<i);j++){
for(int k=0;k<=y;k++){
for(int l=k;l<=y;l++){
dp4[j|(1<<i)][l]=max(dp4[j|(1<<i)][l],dp4[j][k]+dp2[n/2+i][l-k]);
}
}
}
}
for(int i=0;i<(1<<(n/2));i++){
for(int j=1;j<=y;j++){
dp3[i][j]=max(dp3[i][j],dp3[i][j-1]);
}
}
for(int i=0;i<(1<<((n+1)/2));i++){
for(int j=1;j<=y;j++){
dp4[i][j]=max(dp4[i][j],dp4[i][j-1]);
}
}
int res=0;
for(int i=0;i<(1<<n);i++){
int yosan=0;
int bit1=0;
int bit2=0;
for(int bit=n-1;bit>=0;bit--){
bit1*=2;
if(bit>=n/2)bit2*=2;
if(i>>bit & 1){
if(bit<n/2){
bit1++;
}else{
bit2++;
}
}
}
for(int j=0;j<n;j++){
yosan=max(yosan,x-dp[i][j]-dist[j][0]);
}
yosan=min(y,yosan);
for(int j=0;j<=yosan;j++){
res=max(res,dp3[bit1][j]+dp4[bit2][yosan-j]);
}
}
printf("%d\n",res);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int N,X,Y;
int dp[1001][1001];
int G[14][14];
int DP[(1<<14)][14];
int mem[(1<<14)][1001];
int main(){
scanf("%d %d %d",&N,&X,&Y);
for(int id=0;id<N;id++){
for(int i=0;i<=Y;i++)dp[id][i]=-1e9;
dp[id][0]=0;
int K;
scanf("%d",&K);
for(int i=0;i<K;i++){
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
for(int j=0;j<10;j++){
int na=a*(1<<j);
int nb=b*(1<<j);
if(c-(1<<j)<0){
na=a*c;
nb=b*c;
c=0;
}else{
c-=(1<<j);
}
for(int k=Y;k>=na;k--){
if(dp[id][k]<dp[id][k-na]+nb){
dp[id][k]=dp[id][k-na]+nb;
}
}
if(c==0){
break;
}
}
}
for(int i=1;i<=Y;i++){
if(dp[id][i]<dp[id][i-1]){
dp[id][i]=dp[id][i-1];
}
}
}
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
scanf("%d",&G[i][j]);
}
}
for(int k=0;k<N;k++){
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
if(G[i][k]+G[k][j]<G[i][j]){
G[i][j]=G[i][k]+G[k][j];
}
}
}
}
for(int i=0;i<(1<<N);i++){
for(int j=0;j<N;j++){
DP[i][j]=100000000;
}
}
DP[0][0]=0;
for(int bit=0;bit<(1<<N);bit++){
for(int pos=0;pos<N;pos++){
for(int to=0;to<N;to++){
int nbit=bit|(1<<to);
int ncost=DP[bit][pos]+G[pos][to];
if(DP[nbit][to]>ncost){
DP[nbit][to]=ncost;
}
}
}
}
mem[0][0]=0;
for(int i=0;i<=Y;i++)mem[0][i]=-1e9;
int ans=0;
int tmp[1001];
for(int bit=1;bit<(1<<N);bit++){
int ny=min(Y,X-DP[bit][0]);
int dit=bit- (bit&-bit);
for(int i=0;i<=Y;i++) tmp[i]=mem[dit][i];
tmp[0]=0;
for(int i=0;i<N;i++){
if( (bit>>i&1) ){
for(int j=Y;j>=0;j--){
int cc;
cc=0;
for(int k=0;k<=j;k++){
cc++;
if(cc>=100000/Y)break;
if(tmp[j]<tmp[j-k]+dp[i][k]){
tmp[j]=tmp[j-k]+dp[i][k];
}
}
cc=0;
for(int k=j;k>=0;k--){
cc++;
if(cc>=20000/Y)break;
if(tmp[j]<tmp[j-k]+dp[i][k]){
tmp[j]=tmp[j-k]+dp[i][k];
}
}
}
break;
}
}
if(ny>=0 && ans<tmp[ny]){
ans=tmp[ny];
}
for(int i=0;i<=Y;i++) mem[bit][i]=tmp[i];
}
printf("%d\n",ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second
#define dbg(x) cout<<#x" = "<<((x))<<endl
template<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;}
template<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}
using vi = vector<int>;
using vvi = vector<vi>;
const int Y = 1010;
const int INF = 19191919;
struct Town{
int k;
vi a,b,c;
int dp[Y];
Town(){}
void init(){
// read
cin >>k;
a.assign(k,0);
b.assign(k,0);
c.assign(k,0);
rep(i,k) scanf(" %d %d %d", &a[i], &b[i], &c[i]);
// make dp table
rep(i,Y) dp[i] = -INF;
dp[0] = 0;
rep(i,k){
int rem = c[i];
int num = 1;
while(rem>0){
for(int j=Y-1; j>=0; --j)if(dp[j] > -INF){
int nx = j+a[i]*num;
if(nx<Y) dp[nx] = max(dp[nx], dp[j]+b[i]*num);
}
rem -= num;
num *= 2;
if(num > rem) num = rem;
}
}
rep(i,Y-1) dp[i+1] = max(dp[i+1], dp[i]);
}
int MAX(int yen){
return dp[yen];
}
};
int main(){
int n,x,y;
scanf(" %d %d %d", &n, &x, &y);
vector<Town> t(n);
rep(i,n) t[i].init();
vvi d(n, vi(n));
rep(i,n)rep(j,n) cin >>d[i][j];
// Floyd-Warshall
rep(k,n)rep(i,n)rep(j,n) d[i][j] = min(d[i][j], d[i][k]+d[k][j]);
// calc move cost
vvi dp(1<<n, vi(n,INF));
dp[1][0] = 0;
rep(mask,1<<n)rep(i,n)if(mask>>i&1){
rep(j,n){
if(mask>>j&1) continue;
int nmask = mask|(1<<j);
dp[nmask][j] = min(dp[nmask][j], dp[mask][i]+d[i][j]);
}
}
vi move_cost(1<<n,INF);
rep(mask,1<<n){
rep(i,n) move_cost[mask] = min(move_cost[mask], dp[mask][i]+d[i][0]);
}
// two groups
int A = n/2, B = n-A;
// groupA : 0 ~ A-1
vvi dpa(1<<A, vi(Y, -INF));
dpa[0][0] = 0;
rep(i,A){
rep(mask,1<<i){
int nmask = mask|(1<<i);
int tidx = i;
rep(j,Y)if(dp[mask][j] > -INF){
rep(k,Y){
int nj = j+k;
if(nj >= Y) break;
dpa[nmask][nj] = max(dpa[nmask][nj], dpa[mask][j]+t[tidx].MAX(k));
}
}
}
}
// groupB : A ~ A+B-1
vvi dpb(1<<B, vi(Y, -INF));
dpb[0][0] = 0;
rep(i,B){
rep(mask,1<<i){
int nmask = mask|(1<<i);
int tidx = A+i;
rep(j,Y)if(dp[mask][j] > -INF){
rep(k,Y){
int nj = j+k;
if(nj >= Y) break;
dpb[nmask][nj] = max(dpb[nmask][nj], dpb[mask][j]+t[tidx].MAX(k));
}
}
}
}
// check all masks
int ans = 0;
int AA = (1<<A)-1, BB = (1<<B)-1;
rep(mask,1<<n){
int amask = mask&AA;
int bmask = (mask>>A)&BB;
int cost = move_cost[mask];
// use ai yen for group A
rep(ai,y+1){
int bi = min(y-ai, x-cost-ai);
if(bi<0) break;
ans = max(ans, dpa[amask][ai]+dpb[bmask][bi]);
}
}
printf("%d\n", ans);
return 0;
}
|
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
typedef double ld;
typedef complex<ld> Point;
const ll INF = mod * mod;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
typedef vector<int> vec;
typedef vector<string> svec;
int n;
int dp[14][1001];
int dist[14][14];
int dcost[(1 << 14)][14];
int sumcost[1 << 14];
int c1[1 << 7][1001];
int c2[1 << 7][1001];
void solve() {
cin >> n; int x, y; cin >> x >> y;
//start_napzack
rep(i, n) {
int k; cin >> k;
rep(j, y+1) {
dp[i][j] = -mod;
}
dp[i][0] = 0;
rep(j, k) {
//cost,val,num
int a, b, c; cin >> a >> b >> c;
rep(l, a) {
if (l > y)continue;
priority_queue<P> q;
q.push({ dp[i][l],0 });
int ad = 0;
for (int loc = l + a; loc <= y; loc += a) {
ad += b;
P p = q.top();
while (true) {
if (loc / a - p.second > c) {
q.pop(); p = q.top();
}
else break;
}
q.push({ dp[i][loc] - ad,loc / a });
dp[i][loc] = max(dp[i][loc], p.first + ad);
}
}
}
}
//end_napzack
rep(i, n) {
rep(j, n) {
cin >> dist[i][j];
}
}
rep(i, (1 << n))rep(j, n)dcost[i][j] = mod;
dcost[1][0] = 0;
for (int i = 1; i < (1 << n);i+=2) {
rep(j, n) {
rep(k, n) {
if (i&(1 << k))continue;
int ni = i ^ (1 << k);
dcost[ni][k] = min(dcost[ni][k], dcost[i][j] + dist[j][k]);
}
}
}
rep(i, (1 << n)) {
sumcost[i] = mod;
rep(j, n) {
sumcost[i] = min(sumcost[i], dcost[i][j] + dist[j][0]);
}
}
int h = n / 2; int h2 = n - h;
rep(i, (1 << h)) {
rep(j, y + 1)c1[i][j] = -mod;
c1[i][0] = 0;
rep(j, h) {
if (i&(1 << j)) {
per(k, y + 1) {
if (c1[i][k] < 0)continue;
rep(l, y + 1) {
if (k + l > y)break;
c1[i][k + l] = max(c1[i][k + l], c1[i][k] + dp[j][l]);
}
}
}
}
rep1(j, y) {
c1[i][j] = max(c1[i][j], c1[i][j - 1]);
}
}
rep(i, (1 << h2)) {
rep(j, y + 1)c2[i][j] = -mod;
c2[i][0] = 0;
rep(j, h2) {
if (i&(1 << j)) {
per(k, y + 1) {
if (c2[i][k] < 0)continue;
rep(l, y + 1) {
if (k + l > y)break;
c2[i][k + l] = max(c2[i][k + l], c2[i][k] + dp[j + h][l]);
}
}
}
}
rep1(j, y) {
c2[i][j] = max(c2[i][j], c2[i][j - 1]);
}
}
int mid = (1 << h);
int ans = 0;
for (int i = 1; i < (1 << n); i += 2) {
int sc = sumcost[i];
sc = x - sc;
if (sc > y)sc = y;
int r = sc;
int li = i % mid; int ri = i / mid;
rep(j, r + 1) {
int s = c1[li][j] + c2[ri][r - j];
ans = max(ans, s);
}
}
cout << ans << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
//cout << fixed << setprecision(5);
//while (cin >> n>>h>>m>>s,n)solve();
solve();
//stop
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 29;
int N, X, Y, G[14][14];
int tsp[1 << 14][14];
vector< tuple< int, int, int > > vs[14];
int dp1[1 << 7][1001];
int dp2[1 << 7][1001];
int main()
{
cin >> N >> X >> Y;
for(int i = 0; i < N; i++) {
int K;
cin >> K;
for(int j = 0; j < K; j++) {
int a, b, c;
cin >> a >> b >> c;
vs[i].emplace_back(a, b, c);
}
}
for(int i = 0; i < N; i++) {
for(int j = 0; j < N; j++) {
cin >> G[i][j];
}
}
fill_n(*tsp, (1 << 14) * 14, INF);
for(int i = 0; i < N; i++) tsp[1 << i][i] = G[0][i];
for(int i = 0; i < (1 << N); i++) {
for(int j = 0; j < N; j++) {
for(int k = 0; k < N; k++) {
tsp[i | (1 << k)][k] = min(tsp[i | (1 << k)][k], tsp[i][j] + G[j][k]);
}
}
}
vector< int > st1, st2;
int mid = N / 2;
for(int i = 0; i < (1 << mid); i++) st1.emplace_back(i);
for(int i = 0; i < (1 << (N - mid)); i++) st2.emplace_back(i);
for(int i = 0; i < mid; i++) {
for(auto &p : vs[i]) {
int a, b, c;
tie(a, b, c) = p;
for(int k = 0; c > 0; k++) {
int key = min(c, (int) (1 << k));
c -= key;
for(int j = 1000; j >= key * a; j--) {
dp1[1 << i][j] = max(dp1[1 << i][j], dp1[1 << i][j - key * a] + key * b);
}
}
}
for(int j = 1; j <= 1000; j++) {
dp1[1 << i][j] = max(dp1[1 << i][j], dp1[1 << i][j - 1]);
}
}
for(int i = 0; i < N - mid; i++) {
for(auto &p : vs[i + mid]) {
int a, b, c;
tie(a, b, c) = p;
for(int k = 0; c > 0; k++) {
int key = min(c, (int) (1 << k));
c -= key;
for(int j = 1000; j >= key * a; j--) {
dp2[1 << i][j] = max(dp2[1 << i][j], dp2[1 << i][j - key * a] + key * b);
}
}
}
for(int j = 1; j <= 1000; j++) {
dp2[1 << i][j] = max(dp2[1 << i][j], dp2[1 << i][j - 1]);
}
}
sort(begin(st1), end(st1), [&](int a, int b)
{
return (__builtin_popcount(a) < __builtin_popcount(b));
});
sort(begin(st2), end(st2), [&](int a, int b)
{
return (__builtin_popcount(a) < __builtin_popcount(b));
});
for(auto &i : st1) {
if(__builtin_popcount(i) > 1) {
int idx = -1;
for(int j = 0; j < mid; j++) {
if((i >> j) & 1) {
idx = j;
break;
}
}
int bit = i ^(1 << idx);
for(int j = 0; j <= 1000; j++) {
dp1[i][j] = dp1[bit][j];
}
for(auto &p : vs[idx]) {
int a, b, c;
tie(a, b, c) = p;
for(int k = 0; c > 0; k++) {
int key = min(c, (int) (1 << k));
c -= key;
for(int j = 1000; j >= key * a; j--) {
dp1[i][j] = max(dp1[i][j], dp1[i][j - key * a] + key * b);
}
}
}
for(int j = 1; j <= 1000; j++) {
dp1[i][j] = max(dp1[i][j], dp1[i][j - 1]);
}
}
}
for(auto &i : st2) {
if(__builtin_popcount(i) > 1) {
int idx = -1;
for(int j = 0; j < N - mid; j++) {
if((i >> j) & 1) {
idx = j;
break;
}
}
int bit = i ^(1 << idx);
for(int j = 0; j <= 1000; j++) {
dp2[i][j] = dp2[bit][j];
}
for(auto &p : vs[idx + mid]) {
int a, b, c;
tie(a, b, c) = p;
for(int k = 0; c > 0; k++) {
int key = min(c, (int) (1 << k));
c -= key;
for(int j = 1000; j >= key * a; j--) {
dp2[i][j] = max(dp2[i][j], dp2[i][j - key * a] + key * b);
}
}
}
for(int j = 1; j <= 1000; j++) {
dp2[i][j] = max(dp2[i][j], dp2[i][j - 1]);
}
}
}
int ret = 0;
for(auto &s : st1) {
for(auto &t : st2) {
int bit = (t << mid) | s;
int rest = X - tsp[bit][0];
if(rest < 0) continue;
int cost = min(rest, Y);
for(int i = 0; i <= cost; i++) {
ret = max(ret, dp1[s][i] + dp2[t][cost - i]);
}
}
}
cout << ret << endl;
} |
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
typedef double ld;
typedef complex<ld> Point;
const ll INF = mod * mod;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
typedef vector<int> vec;
typedef vector<string> svec;
int n;
int dp[14][1001];
int dist[14][14];
int dcost[(1 << 14)][14];
int sumcost[1 << 14];
int c1[1 << 7][1001];
int c2[1 << 7][1001];
void solve() {
cin >> n; int x, y; cin >> x >> y;
//start_napzack
rep(i, n) {
int k; cin >> k;
rep(j, y+1) {
dp[i][j] = -mod;
}
dp[i][0] = 0;
rep(j, k) {
//cost,val,num
int a, b, c; cin >> a >> b >> c;
rep(l, a) {
if (l > y)continue;
priority_queue<P> q;
q.push({ dp[i][l],0 });
int ad = 0;
for (int loc = l + a; loc <= y; loc += a) {
ad += b;
P p = q.top();
while (true) {
if (loc / a - p.second > c) {
q.pop(); p = q.top();
}
else break;
}
q.push({ dp[i][loc] - ad,loc / a });
dp[i][loc] = max(dp[i][loc], p.first + ad);
}
}
}
}
//end_napzack
rep(i, n) {
rep(j, n) {
cin >> dist[i][j];
}
}
rep(i, (1 << n))rep(j, n)dcost[i][j] = mod;
dcost[1][0] = 0;
for (int i = 1; i < (1 << n);i+=2) {
rep(j, n) {
rep(k, n) {
if (i&(1 << k))continue;
int ni = i ^ (1 << k);
dcost[ni][k] = min(dcost[ni][k], dcost[i][j] + dist[j][k]);
}
}
}
rep(i, (1 << n)) {
sumcost[i] = mod;
rep(j, n) {
sumcost[i] = min(sumcost[i], dcost[i][j] + dist[j][0]);
}
}
int h = n / 2; int h2 = n - h;
rep(i, (1 << h)) {
rep(j, y + 1)c1[i][j] = -mod;
c1[i][0] = 0;
rep(j, h) {
if (i&(1 << j)) {
per(k, y + 1) {
if (c1[i][k] < 0)continue;
rep(l, y + 1) {
if (k + l > y)break;
c1[i][k + l] = max(c1[i][k + l], c1[i][k] + dp[j][l]);
}
}
}
}
rep1(j, y) {
c1[i][j] = max(c1[i][j], c1[i][j - 1]);
}
}
rep(i, (1 << h2)) {
rep(j, y + 1)c2[i][j] = -mod;
c2[i][0] = 0;
rep(j, h2) {
if (i&(1 << j)) {
per(k, y + 1) {
//if (c2[i][k] < 0)continue;
rep(l, y + 1) {
if (k + l > y)break;
c2[i][k + l] = max(c2[i][k + l], c2[i][k] + dp[j + h][l]);
}
}
}
}
rep1(j, y) {
c2[i][j] = max(c2[i][j], c2[i][j - 1]);
}
}
int mid = (1 << h);
int ans = 0;
for (int i = 1; i < (1 << n); i += 2) {
int sc = sumcost[i];
sc = x - sc;
if (sc > y)sc = y;
int r = sc;
int li = i % mid; int ri = i / mid;
rep(j, r + 1) {
int s = c1[li][j] + c2[ri][r - j];
ans = max(ans, s);
}
}
cout << ans << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
//cout << fixed << setprecision(5);
//while (cin >> n>>h>>m>>s,n)solve();
solve();
stop
return 0;
}
|
#include<iostream>
using namespace std;
bool prime(int p){
for(int i=2;i*i<=p;i++)
if(!(p%i))return false;
return true;
}
int main(){
int n,p,ans=0;
cin >> n;
for(int i=0;i<n;i++){
cin >> p;
if(prime(p))ans++;
}
cout << ans << endl;
} |
#include<stdio.h>
bool ss(int n){
if(n<=1) return false;
if(n==2||n==3) return true;
for(int i=2;i*i<=n;i++){
if(n%i==0) return false;
}
return true;
}
int main(){
int i,n,j=0,k,o;
scanf("%d",&o);
while(o--){
scanf("%d",&n);
if(ss(n)){
j++;
}
}
printf("%d\n",j);
}
|
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
int n,num,cnt=0;
cin >>n;
for (int i = 0; i != n; ++i)
{
cin >> num;
for (int j = 2; j <= sqrt(num);++j)
{
if (num%j == 0)
{
++cnt;
break;
}
}
}
cout << n-cnt << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a, d = 0; cin >> a;
for (int i = 0; i < a; i++) {
int b; cin >> b;
d++;
for(int j = 2; j * j <= b; j++) {
if (b % j == 0) {
d--;
break;
}
}
}
cout << d << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int n,ans=0,a,i;
int sub(int x){
if(x==2)return true;
if(x<2||x%2==0)return false;
i=3;
while(i<=sqrt(x)){
if(x%i==0)return false;
i = i+2;
}
return true;
}
int main(){
cin>>n;
for(int j=0;j<n;j++){
cin>>a;
ans+=sub(a);
}
cout<<ans<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int a[n];
int count=0;
for(int i=0;i<n;i++){
cin >> a[i];
for(int j=2;j<=sqrt(a[i]);j++){
if(a[i]%j==0){
count++;
break;
}
}
}
cout << n-count << endl;
}
|
#include<iostream>
#include<vector>
using namespace std;
int main(){
int n,count=0,k;
cin >> n;
int d;
while(n--){
cin >>d;
k =1;
for(int i=2;i*i<=d;i++){
if(d%i==0){
k=0;
break;
}
}
count +=k;
}
cout << count << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int n, ans = 0;
bool solve (int x)
{
for(int i = 2; i <= sqrt(x); i++) if(!(x % i)) return false;
return true;
}
int main(){
cin >> n;
for(int i = 0; i < n; i++){
int x;
cin >> x;
if(solve(x)) ans++;
}
cout << ans << endl;
return 0;
} |
#include <iostream>
using namespace std;
int isPrime(int x){
for(int i=2; i*i<=x; i++){
if(x%i == 0) return 0;
}
return 1;
}
int main(){
int n; cin >> n;
int ans=0;
for(int i=0; i<n; i++){
int x; cin >> x;
ans += isPrime(x);
}
cout << ans << "\n";
} |
#include<stdio.h>
#include<cmath>
#include<algorithm>
int main() {
int n, temp, count=0, p;
scanf("%d", &n);
for(int i=0; i<n; i++) {
scanf("%d", &temp);
p = sqrt(temp);
for(int j=2; j<=p; j++) {
if (temp%j == 0) {
count++;
break;
}
}
}
printf("%d\n", n-count);
return 0;
}
|
#include <iostream>
using namespace std;
int main(void)
{
bool flag;
int n,k=0,a;
cin >> n;
for(int i=0;i<n;i++){
cin >> a;
flag=false;
for(int j=2;j*j<=a;j++){
if(a%j==0){
flag=true;
break;
}
}
if(flag==false) k+=1;
}
cout << k << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
bool isPrime(int a){
for(int i=2;i*i<=a;i++)if(a%i==0)return 0;
return 1;
}
int main(){
int n;
cin>>n;
int ans=0;
while(n--){
int num;
cin>>num;
ans+=isPrime(num);
}
cout<<ans<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n;
cin>>n;
int ans=0;
while(n--){
int k;
cin>>k;
bool f=0;
for(int i=2;i*i<=k;i++) f|=(k%i==0);
if(!f) ans++;
}
cout<<ans<<endl;
return 0;
} |
#include<iostream>
#include<cmath>
using namespace std;
int n,x,c;
int main(){
cin>>n;
for(int i=0;i<n;i++){
cin>>x;
for(int j=2;j<=(int)pow(x,0.5);j++){
if(x%j==0){
c++;
break;
}
}
}
cout<<n-c<<endl;
return 0;
} |
#include<iostream>
bool isP(int x){
for(int i=2;i*i<=x;i++){
if(x%i==0) return false;
}
return true;
}
int main(void){
int n,cnt=0;
int a;
std::cin>>n;
for(int i=0;i<n;i++){
std::cin>>a;
cnt+=isP(a);
}
std::cout<<cnt<<std::endl;
return 0;
}
|
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
int main() {
int n;
cin >> n;
int c = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
int b = sqrt(a);
bool bl = true;
for (int j = b; j > 1; j--) {
if (a % j == 0) {
bl = false;
}
}
if (bl) c++;
}
cout << c << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,ans=0;
cin>> n;
for(int i=0;i<n;i++){
int x;
cin >> x;
bool a=true;
for(int j=2;j<=sqrt(x);j++){
if(x%j==0){
a=false;
break;
}
}
if(a)ans++;
}
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int N;
int x;
int count = 0;
cin >> N;
for(int i = 0; i < N; i++){
cin >> x;
for(int j = 2; j * j <= x; j++)
{
if(x%j == 0){
count++;
break;
}
}
}
cout << N - count << endl;
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int main() {
int n,a,b,ans=0;
cin >> n;
for(int i=0; i<n; i++) {
cin >> a;
b=1;
for(int j=2; j*j<=a; j++) {
if(a%j==0) {
b=0;
break;
}
}
ans+=b;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
int ans = 0;
for(int i=0; i < n; i++){
int a; cin >> a;
bool flg = true;
for(int j=2; j*j <= a; j++){
if(a % j == 0){
flg = false;
}
}
if(flg) ans++;
}
cout << ans << endl;
} |
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int n,i,j,cnt=0,d;
cin>>n;
int a[n];
for(i=0; i<n; i++){
cin>>a[i];
}
for(i=0; i<n; i++){
d=1;
for(j=2; j<=sqrt(a[i]); j++){
if(a[i]%j==0){
d=0;
break;
}
}
if(d==1) cnt++;
}
cout<<cnt<<"\n";
}
|
#include<bits/stdc++.h>
using namespace std;
int a[10000];
int main(){
int n,ans=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=0;i<n;i++){
for(int j=2;j<=sqrt(a[i]);j++){
if(a[i]!=j&&a[i]%j==0){
goto age;
}
}
ans++;
age:;
}
cout<<ans<<endl;
return 0;
}
|
#include <stdio.h>
int q, n, c;
int main() {
scanf("%d", &q);
for(int i = 0; i < q; i++) {
scanf("%d", &n);
if(n > 1) c++;
for(int j = 2; j * j <= n; j++) {
if(n % j == 0) {
c--; break;
}
}
}
printf("%d\n", c);
} |
#include "bits/stdc++.h"
using namespace std;
int main() {
int N, ans = 0;
cin >> N;
for (int i = 0; i < N; i++) {
bool check = true;
int A;
cin >> A;
for (int i = 2; i <= sqrt(A); i++) {
if (A % i == 0) check = false;
}
ans += check;
}
cout << ans << endl;
}
|
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int n;
cin >> n;
int count = n;
while (n--)
{
int x;
cin >> x;
for (int i = 2; i <= sqrt(x); ++i)
if (x % i == 0)
{
count--;
break;
}
}
cout << count << endl;
return 0;
} |
#include <iostream>
using namespace std;
int main() {
int N; cin >> N;
int ans = 0;
for (int i = 0; i < N; i++) {
int p; cin >> p;
ans++;
for (int j = 2; j*j <= p; j++) {
if (p % j == 0) {
ans--;
break;
}
}
}
cout << ans << endl;
}
|
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int num,ans=0;
int temp;
cin>>num;
for(int i=0;i<num;i++){
cin>>temp;
for(int j=2;j<=sqrt(temp);j++){
if(temp%j==0)goto nex;
}
ans++;
nex:;
}
cout<<ans<<endl;
return 0;
} |
#include<cstdio>
using namespace std;
bool check(int n){
for(int i = 2; i * i <= n; i++){
if(n % i == 0) return false;
}
return true;
}
int main(){
int n;
scanf("%d",&n);
int cnt = 0;
for(int i = 0; i < n; i++){
int a;
scanf("%d",&a);
if(check(a)){
cnt++;
}
}
printf("%d\n",cnt);
return 0;
} |
#include<iostream>
using namespace std;
bool isP(int x){
if(x==0||x==1)return false;
for(int i=2;i*i<=x;i++){
if(x%i==0)return false;
}
return true;
}
int main(){
int n,a,cnt=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>a;
cnt+=isP(a);
}
cout<<cnt<<endl;
}
|
#include<iostream>
#include<cstdio>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long int ll;
int main()
{
int n;
int x;
int ans=0;
cin >> n;
for(int i=0;i<n;i++){
cin >> x;
for(int i=2;i*i<=x;i++){
if(x%i==0)goto next;
}
ans++;
next:;
}
cout << ans << "\n";
return 0;
} |
#include <iostream>
#include <cmath>
using namespace std;
bool isPrime(int n)
{
if(n <= 2) return true;
for(int i=2; i*i <= n; i++)
if(n%i == 0) return false;
return true;
}
int main()
{
int a, n, count=0;
cin >> n;
for(int i=0; i<n; i++){
cin >> a;
if(isPrime(a)) count++;
}
cout << count << endl;
}
|
#include<cstdio>
#include<cmath>
bool findPrimeNum(int n){
for(int i=2;i<=sqrt(n);i++)
if(n%i==0) return false;
return n!=1 ? true : false;
}
int main(){
int n,cnt=0;
scanf("%d",&n);
int data;
for(int i=0;i<n;i++){
scanf("%d",&data);
if(findPrimeNum(data)==true)cnt++;
}
printf("%d\n",cnt);
return 0;
} |
#include <stdio.h>
int sosuu(int a){
int i;
if(a==2)return 1;
else if(a%2==0)return 0;
for(i=3;i*i<=a;i++){
if(a%i==0)return 0;
}
return 1;
}
int main(){
int a,b,k=0,i;
scanf("%d",&a);
for(i=0;i<a;i++){
scanf("%d",&b);
if(sosuu(b)==1)k++;
}
printf("%d\n",k);
return 0;
} |
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int n, count=0;
cin >> n;
while(n--){
bool prime = true;
int k, endk;
cin >> k;
endk = (int)sqrt(k);
for( int i=2; i<=endk; i++ ){
if( k%i == 0 ){
prime = false;
break;
}
}
if( prime ) count++;
}
cout << count << endl;
return 0;
} |
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n,i,p,d,j,N=0;
cin >> n;
for (i=0;i<n;++i) {
cin >> p;
d=sqrt(p);
for (j=2;j<d+1;++j) {
if (p%j==0) {
N++;
break;
}
}
}
cout << (n-N) << endl;
return 0;
}
|
#include <vector>
#include <iostream>
using namespace std;
int main()
{
int vals = 0;
cin >> vals;
int count = 0;
while (cin >> vals)
{
int i = 2;
for (; i*i <= vals; ++i)
{
if (vals % i == 0) break;
}
if (i * i > vals || vals == 2) count++;
}
cout << count << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
bool is_prime(int n){
for(int i=2;i*i<=n;i++){
if(n%i==0) return false;
}
return n!=1;
}
int main(){
int n,ans=0,a;
cin>>n;
for(int i=0;i<n;i++){
cin>>a;
if(is_prime(a)) ans++;
}
cout<<ans<<endl;
} |
#include <iostream>
#include <cmath>
using namespace std;
int main(){
int n, num;
int notpr;
cin >> n;
notpr = 0;
for (int i = 0; i < n; i++){
cin >> num;
for (int j = 2; j <= sqrt(num); j++){
if (num % j == 0){
notpr++;
break;
}
}
}
cout << n - notpr << endl;
} |
#include <bits/stdc++.h> //salah
using namespace std;
int main(){
int n;
cin>>n;
int a;
int prima = 0;
for(int i=1; i<=n;i++){
cin>>a;
int prime=1;
if (a==1){
prime=0;
}
for(int j=2; j<= sqrt(a); j++){
if(a % j ==0){
prime=0;
}
}
if(prime==1){
prima=prima+1;
}
}
cout<<prima<<endl;
}
|
#include <iostream>
using namespace std;
bool isPrime(int n){
for(int i=2;i*i<=n;i++){
if(n%i==0) return false;
}
return n!=1;
}
int main() {
int n, a[10000], sum=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
if(isPrime(a[i]))
sum++;
}
cout<<sum<<endl;
return 0;
} |
#include <iostream>
using namespace std;
int main(){
int n,ans=0;
cin>>n;
while(n--){
int a;
cin>>a;
int i=2;
while(i*i<=a && a%i)i++;
if(a%i||a==2)ans++;
}
cout<<ans<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int n;
int ans = 0;
cin >> n;
for(int i=0; i<n; i++){
int x;
cin >> x;
if(x == 2) ans++;
if(x%2 == 0) continue;
int j=3;
for(; j<=sqrt(x); j+=2){
if(x % j == 0) break;
}
if(j > sqrt(x)) {
ans++;
}
}
printf("%d\n", ans);
return 0;
} |
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int main()
{
int n;
cin >> n;
int cnt = 0;
for (int i = 0; i < n; i++){
int a;
cin >> a;
for (int j = 2; j <= sqrt(a); j++){
if (a % j == 0){
cnt++;
break;
}
}
}
cout << n-cnt << endl;
}
|
#include <stdio.h>
int main() {
int n,count = 0;
long x;
double tmp;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%ld", &x);
tmp = x/2;
for (int j = 2; j <= tmp; j++) {
if (x%j == 0) {
count++;
break;
}
tmp = x / (j + 1);
}
}
printf("%d\n", n - count);
return 0;
}
|
#include <iostream>
#include <cmath>
using namespace std;
int main() {
int n, i, j, x, total = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> x;
if (x == 2) total++;
if (x % 2 != 0) {
for (j = 3; j <= (double)sqrt(x); j+=2){
if (x%j == 0) goto a;
}
total++;
a:;
}
}
cout << total << endl;
} |
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int N, a, x,s;
x = 0;
cin >> N;
while (N > 0) {
cin >> a;
s = 0;
for (int i = 2;i <= sqrt(a);i++) {
if (a%i == 0) {
s = 1;
break;
}
}
if (s==0)
x++;
N--;
}
cout << x << endl;
} |
#include<iostream>
#include<cmath>
int main(){
int cnt=0,x,n,j;
std::cin>>n;
for(int i=0;i<n;i++){
std::cin>>x;
//in the case of x=2
if(x==2){
cnt++;
}
j=2;
while(x%j!=0){
if(j>sqrt(x)){
cnt++;
break;
}
j++;
}
}
std::cout<<cnt<<"\n";
return 0;
}
|
#include <iostream>
#include <cmath>
using namespace std;
int main() {
int n, num, count = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> num;
if (num == 2) {
count++;
continue;
}
for (int j = 2; j <= sqrt(num); j++)
if (num % j == 0) {
count--;
break;
}
count++;
}
cout << count << endl;
} |
#include "bits/stdc++.h"
using namespace std;
int isprime(int m){
if (m<2) {return 0;}
if(m==2)return 1;
if(m%2==0)return 0;
for (int i =3 ; i*i <= m; i=i+2) {
if(m%i==0){return 0;}
}
return 1;
}
int main() {
int n,m,l,ans=0;
cin>>n;
for (int i = 0; i < n; ++i) {
cin>>m;
if(isprime(m)){ans+=1;}
}
cout<<ans<<endl;
} |
#include <iostream>
using namespace std;
bool is_prime(int n){
if(n<=1)
return false;
for(int i=2;i*i<=n;i++){
if(n%i==0)
return false;
}
return true;
}
int main(){
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
cin>>a[i];
int num=0;
for(int i=0;i<n;i++){
if(is_prime(a[i]))
num++;
}
cout<<num<<endl;
return 0;
} |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
ll n,x,p,z,i,j;
cin>>n;
z=0;
for(i=1;i<=n;i++){
p=0;
cin>>x;
if(x>2 && x%2==0) p=1;
for(j=3;j*j<=x;j+=2){
if(x%j==0) p=1,j=x;
}
if(p==0) z++;
}
cout<<z<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
bool isPrime(int n){
int m = sqrt(n) + 1;
for(int i=2; i<m; i++){
if(n%i == 0) return false;
}
return true;
}
int main(){
int n, ans = 0;
cin >> n;
for(int i=0; i<n; i++){
int p;
cin >> p;
if(isPrime(p)) ans++;
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int cn1=0;
for(int i=0;i<n;i++){
int x;
cin>>x;
int cn2=0;
for(int j=2;j<=sqrt(x);j++){
if(x%j==0) cn2++;
}
if(cn2==0) cn1++;
}
cout<<cn1<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int Prime(int num);
int main(){
int n;
int ans=0;
cin>>n;
for(int i=0,a;i<n;i++){
cin>>a;
ans+=Prime(a);
}
cout<<ans<<endl;
}
int Prime(int num){
if(num==2)return 1;
if(num%2==0)return 0;
for(int i=3;i<=sqrt(num);i+=2){
if(num%i==0)return 0;
}
return 1;
} |
#include<iostream>
using namespace std;
int main(){
int ans=0;
int n,d;
cin >> n;
int i,j,k;
for(i=0;i<n;i++){
cin >> d;
k=1;
for(j=2;j*j<=d;j++){
if(d%j==0){
k=0;
break;
}
}
ans+=k;
}
cout << ans << endl;
return 0;
} |
#include <iostream>
#include <cmath>
using namespace std;
int n, t, ans=0;
bool isprime(int x) {
for (int i=2; i<=sqrt(x); i++) {
if (x%i==0) return 0;
}
return 1;
}
int main() {
cin >> n;
while (n--) {
cin >> t;
if (isprime(t)) ans++;
}
cout << ans << "\n";
}
|
#include<iostream>
using namespace std;
int main(){
int i,a,b,j,s=0;
cin>>a;
for(int i=0;i<a;i++){
cin>>b;
if(b==2||b==3)s++;
else{
for(j=2;j*j<b;j++){
if(b%j==0)break;
if((j+1)*(j+1)>b)s++;
} }
}
cout<<s<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);++i)
int n,ans=0;
void isPrime(int t){
for(int i=2;i*i<=t;i++){
if(t%i==0) return;
}
ans++;
return;
}
signed main(){
cin >> n;
rep(i,n){
int a;
cin >> a;
isPrime(a);
}
cout << ans << endl;
return 0;
}
|
#include<iostream>
using namespace std;
int main()
{
int count = 0, flag, n, a;
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> a;
flag = 1;
for (int j = 2; j * j <= a; j++)
if (!(a % j))
{
flag = 0;
break;
}
if (flag)
count++;
}
cout << count << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
int main() {
int n; scanf("%d", &n);
int cnt = 0;
rep(i, n) {
int a; scanf("%d", &a);
if (a == 1)continue;
bool ok = true;
for (int j = 2; j*j <= a; j++) {
if (a%j == 0) { ok = false; break; }
}
if (ok)cnt++;
}
printf("%d\n", cnt);
} |
#include<iostream>
#include<algorithm>
#include<math.h>
using namespace std;
int main()
{
int n,x,sum1=0;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>x;
int sum=0;
for(double j=2;j<=(int) (sqrt(x+0.5));j++)
{
if(x%(int)j!=0)
sum++;
}
if(sum==(int)(sqrt(x+0.5))-1)
sum1++;
}
cout<<sum1<<endl;
}
|
#include<iostream>
#include<math.h>
using namespace std;
int prime (int p){
int i,flag=0;
if (p==2){
return 0;
}else{
for (i=2;i<=sqrt(p);i++){
if (p%i==0){
flag=1;
break;
}
}
return flag;
}
}
int main(){
int n,i,p,P=0;
cin >> n;
for (i=1;i<=n;i++){
cin >> p;
P=P+prime(p);
}
cout << n-P << endl;
} |
#include<iostream>
int main(){
int n;
std::cin >> n;
int ans=0;
for (int i = 0; i < n; ++i){
int a;
std::cin >> a;
bool f = true;
for (int j = 2; j*j <= a; ++j){
if (a%j == 0)f = false;
}
if (f)ans++;
}
std::cout << ans << std::endl;
return 0;
} |
#include<iostream>
#include<cmath>
int prime(int a){
int flag=1;
int r=std::sqrt(a);
int n=2;
while(n<=r){
if(a%n==0){
flag=0;
break;
}
n++;
}
return flag;
}
int main(void){
int n,x;
int cnt=0;
std::cin>>n;
for(int i=0;i<n;i++){
std::cin>>x;
if(prime(x)){
cnt++;
}
}
std::cout<<cnt<<'\n';
}
|
#include <bits/stdc++.h>
using namespace std;
bool isprime(int n){
if(n==1)return 0;
if(n==2)return 1;
for(int i=2;i*i<=n;i++){
if(n%i==0)return 0;
}
return 1;
}
int main(){
// freopen("a.txt","r",stdin);
int n,a,res=0;
cin>>n;
while(n--){
cin>>a;
if(isprime(a))res++;
}cout<<res<<endl;
return 0;
}
|
#include<stdio.h>
int main(){
int n,a,sum=0,i,j;
scanf("%d",&n);
for( i=0;i<n;i++){
scanf("%d",&a);
for( j=2;j*j<=a;j++){
if(a%j==0)break;
}
if(j*j>a)sum++;
}
printf("%d\n",sum);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,cnt=0;
cin >> N;
int a[N];
for(int i=0;i<N;i++) cin >> a[i];
for(int i=0;i<N;i++){
int c=1;
for(int j=2;j<=sqrt(a[i]);j++){
if(a[i]%j==0) c=0;
}
if(c==1) cnt++;
}
cout << cnt << endl;
}
|
#include<iostream>
using namespace std;
int prime(int a){
if(a==1)return 0;
else if(a==2)return 1;
else if(a%2==0)return 0;
for(int i=3;i*i<=a;i+=2){
if(a%i==0)return 0;
}
return 1;
}
int main(){
int a,b,k=0;
cin>>a;
for(int i=0;i<a;i++){
cin>>b;
if(prime(b))k++;
}
cout<<k<<endl;
return 0;
}
|
#include <iostream>
#include <cmath>
using namespace std;
int Judge(int i){
int flag=1;
for(int j=2;j<=sqrt(i);j++){
if(i%j==0){
flag=0;
}
}
return flag;
}
int main() {
int n,a;
int count=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>a;
if(Judge(a)){
count++;
}
}
cout<<count<<endl;
return 0;
} |
#include <iostream>
#include <math.h>
int main() {
int n, x, y = 0;
std::cin >> n;
while (n != 0 && std::cin >> x) {
n--; x == 2 ? y++ : 0;
if (x % 2 != 0) {
int _ = 0;
for (int num = 3, k = sqrt(x) + 1; num < k && _ == 0; num++)
x % num == 0 ? _++ : 0;
_ == 0 ? y++ : 0;
}
}
std::cout << y << "\n";
return 0;
}
|
#include<cstdio>
#include<functional>
#include<algorithm>
using namespace std;
int main(void)
{
int i,j,n,x,flg,cnt;
cnt=0;
scanf("%d",&n);
for(i=0;i<n;i++) {
scanf("%d",&x);
flg=1;
for(j=2;j*j<=x;j++) {
if(x%j==0) {
flg=0;
break;
}
}
cnt+=flg;
}
printf("%d\n",cnt);
return 0;
}
|
#include <iostream>
#include <math.h>
using namespace std;
bool sosuu(int x){
if(x==0 || x==1) return false;
for(int i=2;i*i<=x;i++){
if(x%i==0) return false;
}
return true;
}
int main(void){
int N,x,cnt=0;
cin >> N;
for(int i=0;i<N;i++){
cin >> x;
cnt+=sosuu(x);
}
cout << cnt << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
int cnt = 0;
while(n--){
int a; cin >> a;
for(int i=2; i*i<=a; i++)
if(a % i == 0){
cnt--;
break;
}
cnt++;
}
cout << cnt << endl;
return 0;
}
|
#include<stdio.h>
#include<math.h>
int prime(int a){
int i,c=0;
for(i=1;i<=sqrt(a);i++){
if(a%i==0 && i!=1){
c=1;
}
}
if(c==1){
return 0;
}else{
return 1;
}
}
int main(void){
int n,co=0;
while(scanf("%d",&n)==1){
if(prime(n)==1){
co++;
}
}
printf("%d\n",co);
} |
#include<cstdio>
unsigned a,n,c;
inline bool isp(unsigned a){
if(a==2)return true;
for(int i=2;i*i<=a;++i)if(a%i==0)return false;
return true;
}
int main(){
scanf("%d",&n);
for(int i=0;i<n;++i){
scanf("%d",&a);
if(isp(a))++c;
}
printf("%d\n",c);
return 0;
}
|
#include<iostream>
#include<cmath>
using namespace std;
int a,n,t;
bool isprime(int a)
{
int i;
for(i=2;i<=int(sqrt(a));i++)
{
if(a%i==0)
return false;
}
if(i>=sqrt(a))
return true;
else
return false;
}
int main()
{
cin>>n;
while(n--)
{
cin>>a;
if(isprime(a))
t++;
}
cout<<t<<endl;
return 0;
}
|
#include <stdio.h>
bool is_prime(int n)
{
for (int i = 2; i * i <= n; i++)
if (n % i == 0)
return false;
return true;
}
int main()
{
int N, n, k = 0;
scanf("%d", &N);
while (N--)
{
scanf("%d", &n);
if (is_prime(n))
k++;
}
printf("%d\n", k);
return 0;
}
|
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main(){
int x,y,n,b=0,o;
cin>>n;
for (o=0;o<n;o++){
cin>>x;
for(y=2;y*y<=x;y++){
if(x%y==0){
goto loop;
}
}
b++;
loop:;
}
cout<<b<<endl;
}
|
#include<iostream>
bool isP(int x){
if(x==0||x==1)return false;
for(int i=2;i*i<=x;i++){
if(x%i==0)return false;
}
return true;
}
int main(){
int n,a,cnt=0;
std::cin>>n;
for(int i=0;i<n;i++){
std::cin>>a;
cnt+=isP(a);
}
std::cout<<cnt<<"\n";
}
|
#include<stdio.h>
int IsPrime(int I) {
for (int i = 2; i*i <= I; i++) {
if (I%i == 0)return 0;
}
return 1;
}
int main() {
int N;
int A[10000];
int cnt = 0;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &A[i]);
if (IsPrime(A[i]))cnt++;
}
printf("%d\n", cnt);
return 0;
}
|
#include<stdio.h>
int main(){
int i,j,n,x,flag,ans=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&x);
flag=1;
for(j=2; j*j<=x; j++){
if(x%j==0){
flag=0;
break;
}
}
ans+=flag;
}
printf("%d\n",ans);
return 0;
}
|
#include <iostream>
#include <string>
#include <math.h>
using namespace std;
bool prime(int);
int main(){
int n,k,c=0;
cin >> n;
while(n--){
cin >> k;
if(prime(k)) c++;
}
cout << c << endl;
return 0;
}
bool prime(int a){
for(int i=2;i<(int)(sqrt((double)a))+1;i++){
if(a%i==0) return false;
}
return true;
} |
#include<iostream>
using namespace std;
int prime(int x){
if(x==2||x==3)
return 1;
for(int i=2;i*i<=x;i++)
if(x%i==0)
return 0;
return 1;
}
int main(){
int n;
while(cin>>n){
int ans=0;
int x;
for(int i=0;i<n;i++){
cin>>x;
if(prime(x))
ans++;
}
cout<<ans<<endl;
}
return 0;
}
|
#include<iostream>
using namespace std;
bool is_prime(int x){
for(int i=2;i*i<=x;++i){
if(x%i==0)return false;
}
return true;
}
int main(){
int n;
cin >> n;
int ans = 0;
for(int i=0;i<n;++i){
int d;
cin >> d;
ans += is_prime(d);
}
cout << ans << endl;
return 0;
}
|
#include<cstdio>
#include<iostream>
using namespace std;
bool ss(int x){
int i;
i=2;
if(x==1||x==0) return false;
while(i*i <= x && x % i != 0) i++;
return i*i >x ;
}
int main(){
int ans = 0,i,a;
int n;
cin>>n;
for(int i = 0;i < n;i++)
{
cin>>a;
ans += ss(a);
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N; cin >> N;
int ans = 0;
for( int i = 0; i < N; i++ ){
int a; cin >> a;
bool f = true;
for( int i = 2; i * i <= a; i++ ){
if( a % i == 0 ) f = false;
}
if( f ) ans++;
}
cout << ans << endl;
}
|
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int x,n[10000],d,s=0;
cin >> x;
for(int i=0;i<x;i++) cin >> n[i];
for(int i=0;i<x;i++){
d=1;
for(int j=2;j*j<=n[i];j++){
if(n[i]%j==0){
d=0;
break;
}
}
if(d==1) s++;
}
cout << s << "\n";
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.