Pagini recente »
Borderou de evaluare (job #602010)
|
Istoria paginii runda/oni_1/clasament
|
Clasament iluminati...borcanie
|
2014-11-25-test-5
|
Cod sursă (job #720022)
Cod sursă (job
#720022)
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<LL> vl;
typedef vector<vl> vvl;
#define fast ios::sync_with_stdio(false);cin.tie(0);
#define rloop(n) for(int i=1;i<=n;i++)
#define cloop(m) for(int j=1;j<=m;j++)
#define forr(n) for(int i=0;i<n;i++)
#define mp make_pair
#define pb push_back
#define ALL(v) v.begin(), v.end()
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define mx(v) max_element(all(v))
#define mn(v) min_element(all(v))
#define gcd(m,n) __gcd(m,n)
#define lcm(m,n) m*(n/__gcd(m,n))
// ------------> Daca citesti asta esti gay <------------
int main(){
(void)!freopen("zapada.in", "r", stdin);
(void)!freopen("zapada.out", "w", stdout);
return 0;
}