Facebook
From trần bá nguyên, 1 Month ago, written in Plain Text.
This paste is a reply to Untitled from TOMMY - view diff
Embed
Download Paste or View Raw
Hits: 151
  1. #include<bits/stdc++.h>
  2. #define FOR(x,a,b) for (int x=a;x<=b;x++)
  3. #define FOD(x,a,b) for (int x=a;x>=b;x--)
  4. #define pub push_back
  5. #define pob pop_back
  6. #define ii  pair<int,int>
  7. #define pll pair<long long, long long>
  8. #define F first
  9. #define S second
  10. #define fast {ios_base::sync_with_stdio(false);cin.tie(NULL);}
  11. typedef unsigned long long int ull;
  12. typedef long long ll;
  13. const long N=1e5 + 5;
  14. const int mod = 1e9 +7;
  15. using namespace std;
  16. void solve(){
  17.  bool kt[500005];
  18.  memset(kt,true,sizeof(kt));
  19.  kt[0]=kt[1]=false;
  20.  for(int i=2;i*i<=500005;i++)
  21.   if (kt[i])
  22.    for (int j=i*i;j<=500005;j+=i)
  23.     kt[j]=false;
  24.  int n,x;
  25.  cin>>n;
  26.  for (int i=1;i<=n;i++){
  27.   cin>>x;
  28.   while (!kt[x])
  29.    x--;
  30.   cout<<x<<endl;
  31.  }
  32. }
  33. int main(){
  34.     fast;
  35.      freopen("cloprime.inp","r",stdin);
  36.      freopen("cloprime.out","w",stdout);
  37.     solve();
  38.     return 0;
  39. }
  40.