yogesh_6

This program hangs when I enter the number of vertices only..It does nothing..I am not able to figure out what's wrong with this.Please help #include<iostream> #include <list> using namespace std; // This class represents a directed graph using adjacency list representation class Graph { int V; // No. of vertices …

#include<iostream> #include<cstdio> using namespace std; int main() { int test; scanf("%d",&test); while(test--) { int n,m; cin>>m>>n; bool arr[n+1]; for(int i=0;i<n;i++) arr[i]=true; int p=2; for(int i=2;(p*i)<=n;i++) { while((p*i)<=n) { if((p*i)>n) break; arr[(p*i)-1]=false; p++; } p=2; } for(int i=m-1;i<n;i++) { if(arr[i]==true&&i!=0) cout<<i+1<<endl; } } return 0; } **i am trying to generate …

//this is a mine...sieve's algorithm implementation please tell me where i am going wrong...// #include<iostream> #include<vector> using namespace std; int main() { int a,b,p; vector<int> v; cin>>a>>b; for(int i=a;i<=b;i++) v.push_back(i);//inserting all values upto given limit in a vector.. for(p=2;(p*p)<=b;p++) { for(int n=2;(n*p)<=b;n++) { int s=(n*p); v.erase(v.begin()+s);//erase all multiples of 2,3....from …

#include<iostream> using namespace std; int main() { int n;int*p; int i=0,j=0,temp=0; cin>>n; p=new int[n]; for(int i=0;i<n;i++) { cin>>p[i]; } for(j=0;j<n;j++) { for (i=j;i<n;i++) { if(p[i]>p[i+1]) { temp=p[i]; p[i]=p[i+1]; p[i+1]=temp; } } } for(i=0;i<n;i++) cout<<p[i]<<endl; return 0; }