We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 821ba66 commit 82808faCopy full SHA for 82808fa
problem27.java
@@ -0,0 +1,7 @@
1
+/**
2
+By Lakshmi Narayana V, EIE
3
+*/
4
+
5
+public class notpresent {
6
7
+/** * @param args */public static void main(String[] args) { Scanner s=new Scanner(System.in); int n=s.nextInt(); int arr[]=new int[n]; for(int i=0;i<n;i++) arr[s.nextInt()-1]=1; for(int i=0;i<n;i++) if(arr[i]==0) System.out.println(i+1);}}
0 commit comments