This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <stdio.h> | |
| int search(char[], char[]); | |
| int delete_word(char[], char[], int); | |
| int main() | |
| { | |
| char str[80], word[50]; | |
| int index; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <stdio.h> | |
| #include <string.h> | |
| #define MAX_SIZE 100 // Maximum string size | |
| /* Function declaration */ | |
| void removeAll(char * str, char * toRemove); | |
| int main() | |
| { |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| <!DOCTYPE html> | |
| <html> | |
| <head> | |
| <title>Rakesh Pathak | Biodata</title> | |
| <link href="css/style.css" rel="stylesheet" /> | |
| </head> | |
| <body> |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| l=[int(x) for x in input().split()] | |
| l.sort(reverse=True) | |
| s1=s2=0 | |
| l1=[] | |
| l2=[] | |
| for i in l: | |
| if(s1>s2): | |
| s2+=i | |
| l2.append(i) | |
| else: |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def isPrime(n): | |
| for i in range(2,n//2+1): | |
| if n%i==0: | |
| return False | |
| else: | |
| return True | |
| def joinInt(a,b): | |
| n=str(a)+str(b) | |
| return(int(n)) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| <!DOCTYPE html> | |
| <html> | |
| <head> | |
| <title></title> | |
| <style> | |
| html, body, #map{ | |
| height: 500px; | |
| width: 500px; | |
| margin: 0px; | |
| padding: 0px |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| //https://www.aqi.in/assets/images/markers/ | |
| var location_acesss; | |
| var map,map2; | |
| var token = authtoken; | |
| var allmapmarker; | |
| var majorcitydata; | |
| var markers = []; | |
| var user_lat; | |
| var user_lng; | |
| var markerCluster; |