Desktop icons are gone, taskbar won't showUP:

  Solution:
1. Go alt+Ctrl+Delete at the same time and wait for a box to open
2. when the box is open Click "file" at the top and then Click "New Task (Run...)"
3. When you get another small box with something to type in, type in "explorer.exe" (without the ")
4. Your Taskbar and Icons will now load, If not your computer is corrupt. If that happens take your computer to your local IT Guy and ask Him to install explorer for you because it is corrupt


Or you Can do This : (You Have to know a bit about your computer)

1. Go to Run Like in Above
2. Now instead of typing "explorer" type in http://www.google.co.za (or any other web address)
3. Your Default web browser should open. Now type in in the top "C:\" (without ") and your files should open. dont do anything yet
4. Now go Alt+Ctrl+Del and click on the tab "Processes" Find Explorer.exe in that list and click end process.
5. Now In Alt+Ctrl+Del click on the tab "Applications" and end your browser, Normally "Internet Explorer.exe"
6. Restart By going to Alt+Ctrl+Del and clicking "shut down" at the top.
7. This Refreshes your computer and maybe when you have finished restarting you can have your old pc back 

Comments

Post a Comment

Popular posts from this blog

HackerEarth: City and Campers 2 (DSU-UnionFind)

HackerEarth: City and Campers 2 (DSU-UnionFind) ///==================================================/// /// HELLO WORLD !! /// /// IT'S ME /// /// BISHAL GAUTAM /// /// [ bsal.gautam16@gmail.com ] /// ///==================================================/// #include<bits/stdc++.h> # define X first # define Y second # define mpp make_pair # define nl printf("\n") # define SZ ( x ) (int)(x.size()) # define pb ( x ) push_back(x) # define pii pair<int,int> # define pll pair<ll,ll> ///--------------------- # define S ( a ) scanf("%d",&a) # define P ( a ) printf("%d",a) # define SL ( a ) scanf("%lld",&a) # define S2 ( a,b ) scanf("%d%d",&a,&b) # define SL2 ( a,b ) scanf("%lld%lld",&a,&b) ///------------------------------------ # define
Read more

Two Pointers Technique & Binary Search For Beginners

Sample Problem: Electronics Shop ( HackerRank ) (Find me on HackerRank @ Handle:  BishalG  ) Problem Summary: In this problem, you are given two arrays of positive integer numbers of lengths n and m respectively and another positive integer b . Your task is to find out the maximum integer formed by the summation of two integer values taken from different arrays and is less than or equal to b. If there does not exist such summation print -1 . Solution Idea: Since the constraints for n and m are small ( i.e. 1 <= n, m <= 1000 ) , so this problem is very much suitable to test different variants of our solution approaches. Here, we will discuss about 3 different approaches to solve this problem progressively starting from least efficient solution to most efficient one. Approach - 1: Brute-force If we think in brute-force manner, the naive approach to solve this problem will be to try every possible pairing among these two arrays. For this, we can just iterate ove
Read more

Problem : Codeforces Round #406 (Div. 1) B [ Legacy ]( Dijakstra, Segment tree)

You are given graph N (10^5) nodes and starting node (S), You have to find min distance needed to go to all other nodes. Connections among nodes are a little bit different in the form of range type queries, which are: (1) you can open a portal from planet u to planet v with cost z. (2) you can open a portal from planet u to any planet with index in range [l, r] with cost z. (3) you can open a portal from any planet with index in range [l, r] to planet u with cost z. Idea: If we tried to make a adjacency matrix normally by traversing from l to r in (2) and (3) type of connection queries, it will surely time out. So, what we have to do is to think little bit about segmenttree representation of array. This representation allow us to make connection matrix only with LOGN adjacency nodes. So that we may proceed further. Lets build two types of segment-tree nodes , say UP segment tree , which will be used for (2) type of query and DOWN segmenttree which will be used for (3) type of
Read more