Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
54 changes: 36 additions & 18 deletions Graphs/DFS.cpp
Original file line number Diff line number Diff line change
@@ -1,22 +1,40 @@
void Graph::DFSUtil(int v, bool visited[])
{
visited[v] = true;
cout << v << " ";
#include<bits/stdc++.h>

list<int>::iterator i;
for (i = adj[v].begin(); i != adj[v].end(); ++i)
if (!visited[*i])
DFSUtil(*i, visited);
}
using namespace std;

void Graph::DFS(int v)
{
bool *visited = new bool[V];
for (int i = 0; i < V; i++)
visited[i] = false;

DFSUtil(v, visited);
}
typedef pair<int, int> iPair;

vector<int> g[100005];

//font source: geekforgeeks
void dfs(int node , int visited[]){
visited[node] = 1;
cout<<node<<" ";
int l = g[node].size();
for(int j =0;j<l;j++){
int v = g[node][j];
if(visited[v] == 0)
dfs(v , visited);
}
}

int main(){
int nodes , edges;
cout<<"Enter the number of nodes"<<endl;
cin>>nodes;
cout<<"Enter the number of edges"<<endl;
cin>>edges;
cout<<"Enter the edges";
for(int i = 0;i<edges;i++){
int u,v;
cin>>u>>v;
g[u].push_back(v);
g[v].push_back(u);
}
cout<<"DFS traversal of this graph is"<<endl;
int visited[nodes+1];
memset(visited , 0 , sizeof(visited));
for(int i = 1;i<=nodes;i++){
if(visited[i] == false)
dfs(i , visited);
}
}
155 changes: 155 additions & 0 deletions fnagain.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,155 @@
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;
import java.util.StringTokenizer;
import java.util.*;
class fnagain {
static class Reader
{
final private int BUFFER_SIZE = 1 << 16;
private DataInputStream din;
private byte[] buffer;
private int bufferPointer, bytesRead;

public Reader()
{
din = new DataInputStream(System.in);
buffer = new byte[BUFFER_SIZE];
bufferPointer = bytesRead = 0;
}

public Reader(String file_name) throws IOException
{
din = new DataInputStream(new FileInputStream(file_name));
buffer = new byte[BUFFER_SIZE];
bufferPointer = bytesRead = 0;
}

public String readLine() throws IOException
{
byte[] buf = new byte[100000]; // line length
int cnt = 0, c;
while ((c = read()) != -1)
{
if (c == '\n')
break;
buf[cnt++] = (byte) c;
}
return new String(buf, 0, cnt);
}

public int nextInt() throws IOException
{
int ret = 0;
byte c = read();
while (c <= ' ')
c = read();
boolean neg = (c == '-');
if (neg)
c = read();
do
{
ret = ret * 10 + c - '0';
} while ((c = read()) >= '0' && c <= '9');

if (neg)
return -ret;
return ret;
}

public long nextLong() throws IOException
{
long ret = 0;
byte c = read();
while (c <= ' ')
c = read();
boolean neg = (c == '-');
if (neg)
c = read();
do {
ret = ret * 10 + c - '0';
}
while ((c = read()) >= '0' && c <= '9');
if (neg)
return -ret;
return ret;
}

public double nextDouble() throws IOException
{
double ret = 0, div = 1;
byte c = read();
while (c <= ' ')
c = read();
boolean neg = (c == '-');
if (neg)
c = read();

do {
ret = ret * 10 + c - '0';
}
while ((c = read()) >= '0' && c <= '9');

if (c == '.')
{
while ((c = read()) >= '0' && c <= '9')
{
ret += (c - '0') / (div *= 10);
}
}

if (neg)
return -ret;
return ret;
}

private void fillBuffer() throws IOException
{
bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
if (bytesRead == -1)
buffer[0] = -1;
}

private byte read() throws IOException
{
if (bufferPointer == bytesRead)
fillBuffer();
return buffer[bufferPointer++];
}

public void close() throws IOException
{
if (din == null)
return;
din.close();
}
}
public static void main(String args[] ) throws Exception {
Reader fr=new Reader();
int t=fr.nextInt();
int i,j;
String s[];
for(i=1;i<=t;i++)
{
int n=fr.nextInt();
long a[]=new long[n];
s=fr.readLine().split(" ");
for(j=0;j<n;j++)
a[j]=Long.parseLong(s[j].trim());
long x=0;
for(int k=0;k<n;k++)
{
double y=a[k];
for(j=0;j<n;j++)
{
double div=y/a[j];
x=x+(long)Math.round(div);
}

}
System.out.println(x);
}
}
}