Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <fstream>
- #include <string>
- #define N 100001
- using namespace std;
- int P[N],a[N];
- int sum(int n)
- {
- int nr=0;
- string s=to_string(n);
- for(unsigned int i=0;i<s.size();i+=2)
- nr+=s[i]-'0';
- return nr;
- }
- int main()
- {
- P[0]=P[1]=1;
- for(int i=2;i*i<=N;++i)
- if(P[i]==0)
- for(int j=2;i*j<=N;++j)
- P[i*j]=1;
- int n,k;
- ifstream f("gradinita.in");
- f>>n>>k;
- int x,L=0;
- while(n--)
- {
- f>>x;
- if(P[x]&&P[sum(x)])
- a[++L]=x;
- }
- f.close();
- ofstream g("gradinita.out");
- if(L)
- {
- for(int i=1;i<=L;++i)
- if(i%k)
- g<<a[i]<<' ';
- g<<'\n';
- }
- else
- g<<"Toti copiii sunt obraznici!";
- g.close();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement