Skip to content

codeforces tags #32

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 4 commits into
base: master
Choose a base branch
from
Open

codeforces tags #32

Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
ca45d4a
adding the new function - Codeforces tags distribution -
AbdoAwad Mar 5, 2019
3562159
update the new function - Codeforces tags distribution -
AbdoAwad Mar 5, 2019
9ee36bf
update the new function - Codeforces tags distribution -
AbdoAwad Mar 5, 2019
0ca9e16
Merge branch 'master' into master
OmarTahoun May 23, 2019
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
129 changes: 123 additions & 6 deletions index.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -169,7 +169,7 @@ function tagsDistribution (handle){
'brute force' : 0,
'data structures' : 0,
'constructive algorithms' : 0,
'dfs' : 0,
'dfs and similar' : 0,
'sortings' : 0,
'binary search' : 0,
'graphs' : 0,
Expand Down Expand Up @@ -227,16 +227,19 @@ function tagsDistribution (handle){
}
}
console.log () ;
console.log("-----------------------------------------------------------------------------------------")
console.log(colors.yellow("-----------------------------------------------------------------------------------------"))
for (i in tagsDictionary){
if (tagsDictionary[i] != 0)
{

process.stdout.write("[-] "+ i + " : " );
for (var j = 0; j < (tagsDictionary[i] / accepted_Tags.length)*100; ++j)
process.stdout.write(colors.yellow("[-] "+ i + " : ") );
for (var j = 0; j < ((tagsDictionary[i] / accepted_Tags.length) * 100 ) / 2; ++ j)
{
process.stdout.write( '█');
process.stdout.write( colors.yellow('█'));
}
console.log( " " + ((tagsDictionary[i] / accepted_Tags.length)*100).toFixed(2) + " % ");
console.log("-----------------------------------------------------------------------------------------")
console.log(colors.yellow("-----------------------------------------------------------------------------------------"))
}
}

Expand All @@ -245,7 +248,121 @@ function tagsDistribution (handle){
});
}

function tagsCodeforces (handle){
var accepted_Tags_User = [];
var tagsDictionary = {
'implementation' : [0, 0, 'implementation'],
'dp' : [0, 0, 'dp'],
'math' : [0, 0, 'math'],
'greedy' : [0, 0, 'greedy'],
'brute force' : [0, 0, 'brute+force'],
'data structures' : [0, 0, 'data+structures'],
'constructive algorithms' : [0, 0, 'constructive+algorithms'],
'dfs and similar' : [0, 0, 'dfs+and+similar'],
'sortings' : [0, 0, 'sortings'],
'binary search' : [0, 0, 'binary+search'],
'graphs' : [0, 0, 'graphs'],
'trees' : [0, 0 , 'trees'],
'strings' : [0, 0, 'strings'],
'number theory' : [0, 0, 'number+theory'],
'geometry' : [0, 0, 'geometry'],
'combinatorics' : [0, 0, 'combinatorics'],
'two pointers' : [0, 0, 'two+pointers'],
'dsu' : [0, 0, 'dsu'],
'bitmasks' : [0, 0, 'bitmasks'],
'probabilities' : [0, 0,'probabilities' ],
'shortest paths' : [0, 0, 'shortest+paths'],
'hashing' : [0, 0, 'hashing'],
'divide and conquer' : [0, 0, 'divide+and+conquer'],
'games' : [0, 0, 'games'],
'matrices' : [0, 0, 'matrices'],
'flows' : [0, 0, 'flows' ],
'string suffix structures' : [0, 0, 'string+suffix+structures'],
'expression parsing' : [0, 0, 'expression+parsing'],
'graph matchings' : [0, 0, 'graph+matchings'],
'ternary search' : [0, 0, 'ternary+search'],
'meet-in-the-middle' : [0, 0, 'meet-in-the-middle'],
'fft' : [0, 0, 'fft'],
'2-sat' : [0, 0, '2-sat'],
'chinese remainder theorem' : [0, 0, 'chinese+remainder+theorem'],
'schedules' : [0, 0, 'schedules'],
};

request('https://codeforces.com/api/user.status?handle=' + handle, function (error, response, body) {
if (error) {
console.error(error);
} else {
var result = JSON.parse(body);
if (result.status == "FAILED") {
console.log(result.comment);
} else {
result = result.result;
for (i = 0; i < result.length; ++i) {
if (result[i].verdict == "OK") {
var tags= result[i].problem.tags;
accepted_Tags_User.push(tags);
}
}
for (i = 0; i < accepted_Tags_User.length; ++ i)
{
for ( j = 0; j < accepted_Tags_User[i].length; ++j)
{
for (var key in tagsDictionary)
{
if (key == accepted_Tags_User[i][j]){
++ tagsDictionary[key][0];
}
}
}
}
request('https://codeforces.com/api/problemset.problems?' , function (error, response, body) {
var accepted_Result = [];
if (error) {
console.error(error);
} else {
var result = JSON.parse(body);
if (result.status == "FAILED") {
console.log(result.comment);
} else {
var result = result.result;
for (var i = 0; i < result.problems.length; ++i) {
var current_Question = result.problems[i].tags
accepted_Result.push(current_Question);
}
for (i = 0; i < accepted_Result.length; ++ i)
{
for ( j = 0; j < accepted_Result[i].length; ++j)
{
for (var key in tagsDictionary)
{
if (key == accepted_Result[i][j]){
++ tagsDictionary[key][1];
}
}
}
}
console.log () ;
console.log("-----------------------------------------------------------------------------------------");
for (key in tagsDictionary){
process.stdout.write("[-] "+ key + " : " );
for (var j = 0; j < (tagsDictionary[key][0] / tagsDictionary[key][1]) * 100; ++ j)
process.stdout.write('█');
console.log(" " + ((tagsDictionary[key][0] / tagsDictionary[key][1]) * 100).toFixed(2) + " % ");
console.log(colors.yellow("[-] Number of "+ key + " Questions :"+ tagsDictionary[key][1]) +colors.green( " [-] You had Solved : " + tagsDictionary[key][0]) +colors.red( " [-] Not Solved : " +(tagsDictionary[key][1]- tagsDictionary[key][0])));
console.log("[-] To solve more of " + key + " questions visit : " + colors.blue ("https://codeforces.com/problemset?tags="+tagsDictionary[key][2]) );
console.log("-----------------------------------------------------------------------------------------");
}
}
}
});
}
}
});
}





program
.version('1.0.4', '-v, --version');
Expand Down Expand Up @@ -351,4 +468,4 @@ program
console.log("Invalid!!!!!!");
});

program.parse(process.argv);
program.parse(process.argv);