Pages

2/02/2017

Geeksforgeeks Solution For " Composite Series "

GeeksforGeeks Solution For SchoolDomain .Below You Can Find The Solution Of Basic ,Easy ,Medium ,Hard.You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers

Problem :- Given a number N, print all the composite numbers less than or equal to N. The number should be printed in ascending order.Input:The first line contain an Integer T denoting the number of test cases . Then T test cases follow. Each test case consist of an single integer N.Output:Print all the composite Number form 0 to N.Submit Your Solution Click Here Solution :-#include <bits/stdc++.h>using namespace std;int main(){ int t; cin>>t; while(t--) { int n,i,j,res=0; cin>>n; for(i=2;i<=n;i++) { for(j=1;j<i;j++) { if(i%j==0) { res=j; } } if(res>1) cout<<j<<" "; } cout<<endl; } return 0;}Output :-