//https://www.nowcoder.com/practice/3cd4621963e8454594f00199f4536bb1?tpId=37&tqId=21255&rp=1&ru=/exam/oj/ta&qru=/exam/oj/ta&sourceUrl=%2Fexam%2Foj%2Fta%3Fpage%3D1%26pageSize%3D50%26search%3D%26tpId%3D37%26type%3D37&difficulty=undefined&judgeStatus=undefined&tags=&title= #include <iostream> #i...

//https://www.nowcoder.com/practice/3959837097c7413a961a135d7104c314?tpId=37&rp=1&ru=%2Fexam%2Foj%2Fta&qru=%2Fexam%2Foj%2Fta&sourceUrl=%2Fexam%2Foj%2Fta%3Fpage%3D1%26pageSize%3D50%26search%3D48%26tpId%3D37%26type%3D37&difficulty=&judgeStatus=&tags=&title=52&gioEnter=menu #include <iostream> ...

//https://www.nowcoder.com/practice/181a1a71c7574266ad07f9739f791506?tpId=37&rp=1&ru=%2Fexam%2Foj%2Fta&qru=%2Fexam%2Foj%2Fta&sourceUrl=%2Fexam%2Foj%2Fta%3Fpage%3D1%26pageSize%3D50%26search%3D48%26tpId%3D37%26type%3D37&difficulty=&judgeStatus=&tags=&title=65&gioEnter=menu #include <iostream> #...

#include <iostream> #include <forward_list> using namespace std; int main() { int n = 0; while(cin >> n){ forward_list<int> slist; int head = 0; int newnum = 0; int oldnum = 0; int pos = 0; int de = 0; cin &...

//https://www.nowcoder.com/practice/98dc82c094e043ccb7e0570e5342dd1b?tpId=37&rp=1&ru=%2Fexam%2Foj%2Fta&qru=%2Fexam%2Foj%2Fta&sourceUrl=%2Fexam%2Foj%2Fta%3Fpage%3D1%26pageSize%3D50%26search%3D91%26tpId%3D37%26type%3D37&difficulty=&judgeStatus=&tags=&title=75&gioEnter=menu #include <iostream> #...

//https://www.nowcoder.com/practice/bfd8234bb5e84be0b493656e390bdebf?tpId=37&rp=1&ru=%2Fexam%2Foj%2Fta&qru=%2Fexam%2Foj%2Fta&sourceUrl=%2Fexam%2Foj%2Fta%3Fpage%3D1%26pageSize%3D50%26search%3D91%26tpId%3D37%26type%3D37&difficulty=&judgeStatus=&tags=&title=61&gioEnter=menu #include <iostream> u...

//https://www.nowcoder.com/practice/e2a22f0305eb4f2f9846e7d644dba09b?tpId=37&tqId=21314&rp=1&ru=/exam/oj/ta&qru=/exam/oj/ta&sourceUrl=%2Fexam%2Foj%2Fta%3Fpage%3D1%26pageSize%3D50%26search%3D91%26tpId%3D37%26type%3D37&difficulty=undefined&judgeStatus=undefined&tags=&title=91 #include <iostream&gt...

//https://www.nowcoder.com/practice/3350d379a5d44054b219de7af6708894?tpId=37&rp=1&ru=%2Fexam%2Foj%2Fta&qru=%2Fexam%2Foj%2Fta&sourceUrl=%2Fexam%2Foj%2Fta%3Fpage%3D1%26tpId%3D37%26type%3D37&difficulty=&judgeStatus=&tags=&title=94&gioEnter=menu #include <iostream> #include <string> #includ...

#include <iostream> #include <ctype.h> #include <set> using namespace std; string ans(string s){ if(s.size()<=8) return "NG"; //cout << "!" << endl; int tag[4] = {0}; int flag = 0; for(const char &c:s){ if(isupper(c)) //? int ...

//https://www.nowcoder.com/practice/54404a78aec1435a81150f15f899417d?tpId=37&tqId=21274&rp=1&ru=/exam/oj/ta&qru=/exam/oj/ta&sourceUrl=%2Fexam%2Foj%2Fta%3Fpage%3D1%26tpId%3D37%26type%3D37&difficulty=undefined&judgeStatus=undefined&tags=&title= #include <iostream> #include <malloc.h> usi...

#include <iostream> #include <string> using namespace std; int main() { int num = 0; int sum = 0; cin >> num; //string str = to_string(num); for(int i = 1;i<=num;i++){ string str = to_string(i); if(i%7==0||str.find('7')!=str.npos) ...

#include <bits/stdc++.h> using namespace std; typedef long long ll; int main() { int num; while (cin >> num) { for (int i = 2; 1ll * i * i <= num; i++) //1LL会在运算时把后面的临时数据扩容成long long类型 //n的值在每次循环结束可能会改变 //类似于辗转相除法 //隐含的判断条件是当前的n没有小于sqrt(n)的因子，即n为质数，...

#include <iostream> #include <math.h> #include <vector> using namespace std; void InsertSort(vector<int>& ans, int temn); bool isPrime(int temn, int& n); int main() { int num = 0; int n = 0; vector<int> ans, tem; cin >> num; tem.push_back...

//https://www.nowcoder.com/practice/98dc82c094e043ccb7e0570e5342dd1b?tpId=37&&tqId=21298&sourceUrl=https%3A%2F%2Fwww.nowcoder.com%2Fexam%2Foj #include <bits/stdc++.h> using namespace std; int main() { string s1, s2; cin >> s1 >> s2; int n = s1.size(); int m = s...