OJ Board

#include<iostream> #include<sstream> #include<vector> using namespace std; #define vi vector<int> #define sz size() #define pb push_back #define imax 100000001; struct node{ int data; struct node* left; struct node* right; }; struct node* rec(vi in,vi p) { if (in.sz==0) return NULL; int t; bool fla...

//nth combination of 0 and 1's #include<iostream> #include<string> #include<vector> using namespace std; string s1,s2; vector<char> v; void backtrack(int n,int i) { if(i==2*n) { vector<char> vi,vi1; int j=0; for (int k=0;k<v.size();k++) { // cout<<v[k]; if (v[k]=='i') { vi.push_back(s1[j]); j++; } ...

#include<iostream> #include<vector> #include<cmath> #include<string> #include<algorithm> using namespace std; struct edge{ int x; int y; }; int main() { int n; int q=1; while (cin>>n && n!=0) { vector< edge > v; for (int i=0;i<n;i++) { edge e; cin>>e.x>>e.y; v.push_back(e); } vector<int> vi...

#include<iostream> #include<cmath> using namespace std; int main() { int l=1,u=20000000,d,j; d=u-l+1; bool *flag=new bool[d]; for (int i=0;i<d;i++) flag[i]=true; for (int i=(l%2!=0);i<d;i+=2) flag[i]=false; for (int i=3;i<=sqrt(u);i+=2) { j=l; while (j%i!=0) j++; for (j=j+i;j<u;j+=i) flag[j-l]=fals...

i would like to know its elobaration...

plz give the test cases for which it is incorret or point out mistakes...
plz help me out...[/b]

thanx i got ac

I am getting damn stupid WA ??.. #include <iostream> #include <cmath> using namespace std; int main() { int x,i=1; int n; cin>>n; while (i<=n){ cin >> x; long long int a,b,c; a=1;b=1; for (int j=3;j<=x+2;j++) { int t; t=a; a=a+b; b=t; } cout << "Scenario #" << i++ <<":"<< endl <<...

hi freinds i got re twice i cannot figure out why plz help me... #include<iostream> #include<string> #include<vector> #include<algorithm> using namespace std; int main() { int n; int j=1; while (cin>>n && n!=0) { int a[n]; for (int i=0;i<n;i++) cin>>a[i]; vector<long long int> v; for (int i...

i am getting correct answers for all available test cases still i am getting WA plz help... #include<iostream> #include<string> #include<vector> using namespace std; int main() { int n; cin>>n; for (int i=0;i<n;i++) { int q; cin>>q; int a[q-1]; int b[q-1]; for (int j=0;j<q-1;j++) cin>>a[j]; int sum...

#include<iostream> #include<string> #include<vector> #include<cmath> #include<algorithm> using namespace std; int main() { string str; while (getline(cin,str)) { if(!((int)str[0]>47 && (int)str[0]<58)) { // int l=0; for (int i=str.size();i>=0;i--) { int t=(int)str[i]; while (t>0) { cout<<t%...