上一页 1 2 3 4 5 6 7 8 9 ··· 16 下一页
摘要: # Roman Numerals Helper # https://www.codewars.com/kata/51b66044bce5799a7f000003/train/python class RomanNumerals: # @staticmethod 是一个装饰器, 用来标识一个方法为静态 阅读全文
posted @ 2025-03-07 20:32 Kazuma_124 阅读(7) 评论(0) 推荐(0)
摘要: # Twice linear # https://www.codewars.com/kata/5672682212c8ecf83e000050/train/python def dbl_linear(n): # i=0 # j=0 i,j = 0,0 #同时定义多个变量的方式 sequence = 阅读全文
posted @ 2025-03-07 20:31 Kazuma_124 阅读(8) 评论(0) 推荐(0)
摘要: //B. Transfusion #include <iostream> #include <vector> void solve(){ int n; std::cin>>n; int countOfOdd = (n+1)/2; int countOfEven = n/2; long long su 阅读全文
posted @ 2025-03-07 20:29 Kazuma_124 阅读(10) 评论(0) 推荐(0)
摘要: //A. Line Breaks #include <string> #include <iostream> void solve(){ int n,left; std::cin>>n>>left; int count = 0; while(n--){ std::string temp; std:: 阅读全文
posted @ 2025-03-07 20:29 Kazuma_124 阅读(18) 评论(0) 推荐(0)
摘要: #include <iostream> void solve(){ int n,a,b,c; std::cin>>n>>a>>b>>c; int ans = n/(a+b+c) * 3; n = n%(a+b+c); if(n==0){ std::cout<<ans<<std::endl; retu 阅读全文
posted @ 2025-03-07 20:28 Kazuma_124 阅读(6) 评论(0) 推荐(0)
摘要: //luogu,P11568 「chaynOI R1 T1」一维数组p11568 //洛谷T382521 #include <iostream> int main(){ int n,m; std::cin>>n>>m; for(int i = 0;i<n;++i){ std::cout<<1; } 阅读全文
posted @ 2025-03-07 20:28 Kazuma_124 阅读(11) 评论(0) 推荐(0)
摘要: //codeforces 2057B #include <iostream> #include <utility> #include <set> #include <map> #include <numeric> struct cmp{ bool operator()(const std::pair 阅读全文
posted @ 2025-03-07 20:27 Kazuma_124 阅读(6) 评论(0) 推荐(0)
摘要: #include <iostream> void solve(){ int n,a,b;std::cin>>n>>a>>b; if((a-b)%2==0 || (b-a)%2==0){ std::cout<<"YES"<<std::endl; }else{ std::cout<<"NO"<<std: 阅读全文
posted @ 2025-03-07 20:26 Kazuma_124 阅读(4) 评论(0) 推荐(0)
摘要: #include <iostream> #include <vector> #include <climits> void solve(){ int n;std::cin>>n; std::vector<int> a(n); for(int i = 0;i<n;++i)std::cin>>a[i]; 阅读全文
posted @ 2025-03-07 20:26 Kazuma_124 阅读(17) 评论(0) 推荐(1)
摘要: //codeforce 2053B #include <iostream> #include <vector> #include <unordered_set> #include <map> #include <algorithm> void solve(){ int n;std::cin>>n; 阅读全文
posted @ 2025-03-07 20:25 Kazuma_124 阅读(10) 评论(0) 推荐(0)
上一页 1 2 3 4 5 6 7 8 9 ··· 16 下一页