Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises) ABC
退役老年人的血崩CF。。。c++ A 水題less #include<bits/stdc++.h>
using namespace std;
int n;
int main()
{
scanf("%d",&n);
int x=n/2;
while(1)
{
if(__gcd(x,n-x)==1)
break;
相關文章
- 1. Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)
- 2. Codeforces Round #680 (Div. 2, based on Moscow Team Olympiad)
- 3. Codeforces Round #453 (Div. 2) ABC
- 4. Codeforces Round #448 (Div. 2) ABC
- 5. Codeforces Round #419 (Div. 2) ABC
- 6. Codeforces Round #596 (Div. 2, based on Technocup 2020 Elimination Round 2) C題
- 7. Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)
- 8. Codeforces Round #433 Div. 2 B Maxim Buys an Apartment
- 9. Codeforces Round #687 (Div. 2, based on Technocup 2021 Elimination Round 2) （我的題解)
- 10. 【原創】【Codeforces】Codeforces Round #500 (Div. 2) [based on EJOI] A.Piles With Stones & B.And
- 更多相關文章...
- • PHP round() 函數 - PHP參考手冊
- • SQL ROUND() 函數 - SQL 教程
- • Flink 數據傳輸及反壓詳解
- • 爲了進字節跳動，我精選了29道Java經典算法題，帶詳細講解
相關標籤/搜索
每日一句
-
每一个你不满意的现在，都有一个你没有努力的曾经。
最新文章
- 1. Window下Ribbit MQ安裝
- 2. Linux下Redis安裝及集羣搭建
- 3. shiny搭建網站填坑戰略
- 4. Mysql8.0.22安裝與配置詳細教程
- 5. Hadoop安裝及配置
- 6. Python爬蟲初學筆記
- 7. 部署LVS-Keepalived高可用集羣
- 8. keepalived+mysql高可用集羣
- 9. jenkins 公鑰配置
- 10. HA實用詳解
歡迎關注本站公眾號,獲取更多信息
相關文章
- 1. Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)
- 2. Codeforces Round #680 (Div. 2, based on Moscow Team Olympiad)
- 3. Codeforces Round #453 (Div. 2) ABC
- 4. Codeforces Round #448 (Div. 2) ABC
- 5. Codeforces Round #419 (Div. 2) ABC
- 6. Codeforces Round #596 (Div. 2, based on Technocup 2020 Elimination Round 2) C題
- 7. Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)
- 8. Codeforces Round #433 Div. 2 B Maxim Buys an Apartment
- 9. Codeforces Round #687 (Div. 2, based on Technocup 2021 Elimination Round 2) （我的題解)
- 10. 【原創】【Codeforces】Codeforces Round #500 (Div. 2) [based on EJOI] A.Piles With Stones & B.And