harrypotter0
/ wordlist.txt
Last active
April 24, 2019 07:55
This file contains 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
| RBI | |
| grade | |
| toppers | |
| strategy | |
| current | |
| UPSC | |
| SSC | |
| GATE | |
| study | |
| arrays |
This file contains 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
| header#banner.navbar.navbar-default.navbar-fixed-top | |
| .container | |
| a.scrollable(href='#top') | |
| img(src='https://photos-1.dropbox.com/t/2/AAB9Qj9EsKFwiUHuQYp6IAg-x8kWCRY3lQiHPoIX-hk6zA/12/576333012/png/32x32/1/_/1/2/images.png/EPaX8dAEGB0gAigCKAQ/59DJspgisaIENrO_o1WytxtDeGC19M_Rvc8tFcTcaMw?size=1280x960&size_mode=3', alt='Bond', title='Bond') | |
| button.navbar-toggle.collapsed(type='button', data-toggle='collapse', data-target='#navbar', aria-expanded='false') | |
| span.sr-only Toggle navigation | |
| span.icon-bar | |
| span.icon-bar | |
| span.icon-bar | |
| nav#navbar.collapse.navbar-collapse(role='navigation') |
harrypotter0
/ CODING.txt
Created
October 19, 2016 18:46
This file contains 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
| http://codeforces.com/blog/entry/47880 |
harrypotter0
/ 389B - Fox and Cross.cpp
Created
October 15, 2016 03:09
This file contains 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<iostream> | |
| char A[101][101],i,j; int s,n; | |
| int main(){ | |
| scanf("%d",&n); | |
| for(i=1;i<=n;i++) | |
| scanf("%s",A[i] + 1); | |
| for(i=1;i<=n;i++) | |
| for(j=1;j<=n;j++) | |
| if(A[i][j] == '#' && A[i][j+1] == '#' && A[i+1][j] == '#' && A[i][j-1] == '#' && A[i-1][j] == '#') |