#include <iostream>
#include <sstream>
#include <string>
#include <random>
#include <ctime>
#include <bits/stdc++.h>
using namespace std;
void CountAndSay(long long &n, const long long &progress, string &result);
void Count(string &result);
int main()
{
long long n, progress = 1;
string result = "1";
cin >> n;
CountAndSay(n, progress, result);
cout << result;
} // main()
void CountAndSay(long long &n, const long long &progress, string &result)
{
if (n == 1 || n == progress)
return;
else if (n == 0)
result = "10";
else
{
Count(result);
CountAndSay(n, progress + 1, result);
} //else
} // count-and-say()
void Count(string &result)
{
string temp;
long long previous = 0;
for (long long i = 0; i < result.length(); i++)
if (result[i] != result[i + 1])
{
temp = temp + to_string(i + 1 - previous) + result[i];
previous = i + 1;
} //if
result = temp;
} // Count()
C. 完美平方數 #include <iostream> #include <math.h> using namespace std; int numSquares(int n); int main() { int num, ans;
Jan 27, 2022E. 鐵路 本題源自於Onling Judge:514 - Rails 題目目標在於給定出站順序的前提下,利用已知入站順序1~N, 確定是否仍能夠以目標出站順序離開。 有一個簡單的想法,我們利用queue的特性來維護出站順序、 利用stack的特性來維護入站順序, 並依次比較它們的front/top是否相同,如果相同就安排出站(pop)。
Jan 27, 2022C. 組合 #include<bits/stdc++.h> using namespace std; vector<int> a; bool first=true,f=true; fstream input,output; void find(int g,vector<int> &can,int p){ if(!g){ if(!first){
Sep 19, 2021D. Flood Fill # include <bits/stdc++.h> using namespace std; int m[102][102]; struct Fill{ int x,y,t; };
Sep 16, 2021or
By clicking below, you agree to our terms of service.
New to HackMD? Sign up