Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
MINVEST
#include <iostream> #include <sstream> #include <cstdio> #include <cstdlib> #include <cmath> #include <cctype> #include <cstring> #include <vector> #include <list> #include <queue> #include <deque> #include <stack> #include <map> #include <set> #include <algorithm> #include <numeric> using namespace std; #define fr(i,m,n) for(i=m;i<n;i++) #define ifr(i,m,n) for(i=m;i>n;i--) #define ll long long #define ull unsigned ll #define sc scanf #define pf printf #define var(x) x i=0,j=0,tmp1=0,tmp2=0,tmp3=0,tmp=0,tmp4=0,tmp5=0,flag=0,T=0,N=0,M=0,X,Y #define pb push_back #define vi vector<int> #define vii vector<pair<int,int> > #define vvii vector<vector<pair<int,int> > > #define vl vector<ll> #define vll vector<pair<ll,ll> > #define all(c) c.begin(), c.end() #define br cout<<"\n" #define sz 502 #define INTI_MAX 1000000000 int main() { var(int); cin>>T; int prpl,years,d; while(T--) { vii bonds; cin>>prpl>>years; cin>>d; fr(i,0,d) { cin>>tmp1>>tmp2; bonds.pb(make_pair(tmp1,tmp2)); } } }
run
|
edit
|
history
|
help
0
StackPat
Income calculator
reverseKNode
inheritance
inversion of array using merge sort
Client
Making pyramid using nested loop 2/2
Laborator 2 SD
Full System Specifications
Vectors as Inputs to Map