关于OJ1028的参考解法

其中运用了最小公倍数与最大公约数乘积等于两数相乘的定理. #include <stdio.h> int main(int argc, char *argv[]) { int a,b,c,d,e; scanf("%d %d",&a,&b); d=a*b; ) { c=a%b; a=b; b=c; } e=d/a; printf("%d\n",e); ; }…

关于欧几里得算法求最大公约数，即OJ1029的参考解法

#include <stdio.h> int main(int argc, char *argv[]) { int a,b,c; scanf("%d %d",&a,&b); ) { c=a%b; a=b; b=c; } printf("%d\n",a); ; }…

Codeforces Round #380 (Div. 2) 解题报告

第一次全程参加的CF比赛(虽然过了D题之后就开始干别的去了),人生第一次codeforces上分--(或许之前的比赛如果都参加全程也不会那么惨吧),终于回到了specialist的行列,感动~.虽然最后也只过了A.B.D3题,但能上分还是非常的激动不已呀. 先发出来A.B.D的参考解法,C比赛时读了题感觉自己可以做出来,但时间只剩20分钟了,索性弃疗--. 11.23 补充上了C的参考代码 A题: 题目地址用一些str函数应该也可以做,但考虑到字符串长度只有不到100以及题目整体不是很复杂,不…

leetcode Database3（Nth Highest Salary<—>Consecutive Numbers<—>Department Highest Salary）

一.Nth Highest Salary Write a SQL query to get the nth highest salary from the Employee table. +----+--------+ | Id | Salary | +----+--------+ | 1 | 100 | | 2 | 200 | | 3 | 300 | +----+--------+ For example, given the above Employee table, the nth hig…

leetcode：Lowest Common Ancestor of a Binary Search Tree

Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST. According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes v and w as the lowest node in T that has…

leetcode：House Robber（动态规划dp1）

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security system connected and it will autom…

leetcode：Isomorphic Strings

Isomorphic Strings Given two strings s and t, determine if they are isomorphic. Two strings are isomorphic if the characters in s can be replaced to get t. All occurrences of a character must be replaced with another character while preserving the or…