fork download
  1. /*
  2. //! In The Name Of Allah
  3.  
  4.  
  5.  
  6.  
  7. */
  8. #include<bits/stdc++.h>
  9. using namespace std;
  10. #define tt int t;cin>>t;while(t--)
  11. #define itr(i,a) for(int i=0;i<a;i++)
  12. #define ittr(i,bg,a) for(int i=bg;i<a;i++)
  13. #define yes cout<<"YES"<<endl
  14. #define no cout<<"NO"<<endl
  15. #define ll long long
  16. #define endd cout<<endl
  17. #define vc(v, n) vector<ll> v(n)
  18. #define srt(v) sort(v.begin(), v.end())
  19. #define rsrt(v) sort(v.rbegin(), v.rend())
  20. #define pb(a,x) a.push_back(x)
  21. #define MOD 1000000007
  22. #define f first
  23. #define sc second
  24. #define endl '\n'
  25. const int N=1e6+1;
  26. vector<bool>isprime(N,false);
  27. vector<ll>primes;
  28. ll cnt_div[N]={0};
  29. vector<ll>divisor[N];
  30. void divis(){
  31. for(int i=1;i<=N;i++){
  32. for(int j=i;j<=N;j+=i){
  33. cnt_div[j]++;
  34. divisor[j].push_back(i);
  35. //if(i/j!=i) divisor[j].push_back(i/j);
  36. }
  37. }
  38.  
  39. }
  40. void sieve(){
  41. isprime[1]=false;
  42. isprime[2]=true;
  43. pb(primes,2);
  44. for(int i=3;i*i<=N;i+=2) isprime[i]=true;
  45. for(int i=3;i<=N;i+=2){
  46. if(isprime[i]){
  47. pb(primes,i);
  48. for(int j=i*i;j<=N;j+=i){
  49. isprime[j]=false;
  50. }
  51. }
  52. }
  53. }
  54.  
  55. int main(){
  56. ios::sync_with_stdio(false);
  57. cin.tie(nullptr);
  58. // sieve();
  59. // divis();
  60. tt{
  61.  
  62.  
  63. }
  64. }
  65.  
  66.  
  67.  
Success #stdin #stdout 0.01s 28808KB
stdin
Standard input is empty
stdout
Standard output is empty