最近看到的,刷一下来练手 https://ac.nowcoder.com/acm/contest/315#question 平方数 int main(){cin>>n;ll q=sqrt(n);if(q*q<=n)cout<<q*q<<endl;return 0;} 勇气获得机 int main(){cin>>n;stack<char>ans;while(n>0){if(n&1){
Problem Description “WTF! While everyone has his girl(gay) friend, I only have my keyboard!” Tired of watching others’ affair, Hillan burst into scream, which made him decide not to hold it back. “A
There are NN cities in the country, and MM directional roads from uu to v(1\le u, v\le n)v(1≤u,v≤n). Every road has a distance c_ic i . Haze is a Magical Girl that lives in City 11, she can choose
E. Girl Permutation 题意 有一个位置的长度为 n n n 的排列 ,现在给定一个前缀最值下标数组 p p p 和一个后缀最值下标数组 s s s 在位置 i i i 的前缀最值下标定义为:以 i i i 为结尾的前缀,最大值恰好在 i i i,也就是 ∀ j < i , a j < a i \forall j < i,a_j < a_i ∀j<i,aj
1000ms 262144K There are N cities in the country, and M directional roads from u to v(1≤u,v≤n). Every road has a distance ci. Haze is a Magical Girl that lives in City 1, she can choose no more tha