SHARE
TWEET

Untitled

jedrzejd Apr 18th, 2019 61 Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
  1. //
  2. //  main.cpp
  3. //  zad1
  4. //
  5. //  Created by Karol on 16/04/2019.
  6. //  Copyright © 2019 Karol. All rights reserved.
  7. //
  8.  
  9. #include <iostream>
  10. #include <algorithm>
  11. #include <cstdio>
  12. #include <cmath>
  13. #include <utility>
  14. #include <vector>
  15. #include <map>
  16. #include <queue>
  17. #include <string>
  18. #define f first
  19. #define s second
  20. #define pb push_back
  21. #define mp make_pair
  22. #define REP(i,n) for(int i=0;i<(n);i++)
  23. #define REPT(i,a,b) for(int i=(a);i<=(b);i++)
  24. using namespace std;
  25. const int MXN=3e5+5;
  26. inline void fastcin(){
  27.     ios_base::sync_with_stdio(0);
  28.     cin.tie(0);cout.tie(0);
  29. }
  30. int tab[MXN],tab1[MXN],n,t[MXN][2],nr;
  31. deque<int>kolejka;
  32. inline void czysc(){
  33.     while(!kolejka.empty())kolejka.pop_back();
  34. }
  35. inline void zamien(int a){
  36.     czysc();
  37.     while(a>0){
  38.         if(a%2==1)kolejka.push_front(1);
  39.         else kolejka.push_front(0);
  40.         a/=2;
  41.     }
  42.     while(kolejka.size()<30){
  43.         kolejka.push_front(0);
  44.     }
  45. }
  46. inline void dodaj(int a){
  47.    
  48.     nr++;
  49.    
  50. }
  51. int main(){
  52.     fastcin();
  53.     cin>>n;
  54.     REP(i,n){
  55.         cin>>tab[i];
  56.     }
  57.     REP(i,n){
  58.         cin>>tab1[i];
  59.     }
  60. }
RAW Paste Data
We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the Cookies Policy. OK, I Understand
Not a member of Pastebin yet?
Sign Up, it unlocks many cool features!
 
Top