今天C++第二题，我赌数据给错了！

构造队列： #include <iostream> #include <queue> #include <vector> using namespace std; int main(void) { int t; cin >> t; while (t--) { int n; cin >> n; queue<int> q; for (int i = n; i > 0; --i) { q.push(i); if (i != n) { int x = q.front(); q.pop(); q.push(x); } } vector<int> nums; nums.reserve(n); while (!q.empty()) { nums.push_back(q.front()); q.pop(); } cout << nums[n-1]; for (int i = n-1; i > 0; --i) cout << ' ' << nums[i-1]; cout << endl; } return 0; }

#include "iostream" #include "queue" using namespace std; int main() {     int n;     int T;     cin>>T;     int a[ 100000 ];     queue< int > q;     while (T--) {         cin>>n;                  for ( int i= 0 ;i<n;++i)             q.push(i);         int i= 1 ;         while (!q.empty()) {             int x=q.front();             q.pop();             q.push(x);             x=q.front();             a[x]=i++;             q.pop();         }         cout<<a[ 0 ];         for ( int i= 1 ;i<n;++i)             cout<< ' ' <<a[i];                  cout<<endl;     }     return 0 ; }

#include <vector> #include <iostream> #include <algorithm> using namespace std; void getQuque(int temp) { vector<int> iVec(temp, -1); vector<int>::iterator itor; int loc = -1, count = 1, countZ = 0; while (1) { if(count >= temp) break; while (1) { if(loc == temp) loc = 0; if (iVec[(loc + 1)%temp] != -1) { ++loc; if(loc == temp) loc = 0; } else { loc++; countZ += 1; if(loc == temp ) loc = 0; if(countZ == 2) { countZ = 0; break; } } } iVec[loc] = count; ++count; } for (int i = 0; i < temp; ++i) { if(iVec[i] == -1) cout<<count; else cout<<iVec[i]; if (i != temp - 1) cout<<" "; } } int main() { int n, temp; cin>>n; vector<int> nVec; for (int i = 0; i < n; ++i) { cin>>temp; nVec.push_back(temp); } for (int i = 0; i < n; ++i) { getQuque(nVec[i]); if (i != n - 1) cout<<endl; } return 0; }

#include <iostream> #include <vector> #include <deque> using namespace std; int main() { int T; cin >> T; for (int i = 0; i < T; i++) { int n; cin >> n; int *array = new int[n]; deque<int*> deq; for (int i = 0; i < n; i++) deq.push_back((array + i)); int cnt = 1; while (!deq.empty()) { int *x = deq.front(); deq.pop_front(); deq.push_back(x); x = deq.front(); *x = cnt++; deq.pop_front(); } int index = 0; for (; index < n - 1; index++) cout << array[index] << " "; cout << array[index] << endl; } return 0; }

#include <iostream> #include <queue> #include <unordered_map> using namespace std; typedef unordered_map<int, int> dict; void constructQueue( int n ){ queue<int> Q; dict tmp; for( int i=1; i<=n; ++i ){ Q.push( i ); } int cnt = 1; while( !Q.empty()){ int x = Q.front(); Q.pop(); Q.push(x); x = Q.front(); tmp.emplace( x, cnt++ ); Q.pop(); } for( int i=1; i<=n; ++i ){ if( i!=n ) cout<<tmp[i]<<" "; else cout<<tmp[i]<<endl; } } int main(int argc, char *argv[]) { int n; cin>>n; int num[n]; for(int i=0; i<n; ++i){ cin>>num[i]; } for(int i=0; i<n; ++i){ constructQueue(num[i]); } return 0; } 我在想这样做是不是比较猥琐。。。

楼主你贴面写下来自某友商吧。。以免别人以为牛客的数据错了。。

#include <iostream> #include <vector> using namespace std; int main() { int num; long int n, k; cin >> num; if (num > 100 || num <= 0) return 0; while (num) { vector<long int> res; cin >> n >> k; for (long int i = 0; i < 2 * n; i++) { long int temp; cin >> temp; if (temp < 1 || temp>1000000000) return 0; res.push_back(temp); } vector<int> temp(2 * n, 0); for (long int i = 0; i < k; i++) { int m = 0; for (long int z = 0, j = n; z < n; z++, j++) { temp[m++] = res[z]; temp[m++] = res[j]; } for (long int x = 0; x < 2 * n; x++) res[x] = temp[x]; } for (long int i = 0; i < 2 * n; i++) { if (i == 2*n - 1) cout << res[i]<<endl; else cout << res[i] << " "; } num--; } system("pause"); return 0; } 输出全部错误  什么玩意  在下边好好地   时间全搭这道题上了  尼玛

跟 3# AC 代码编译出来的结果比了一下， 10000 以内的 n 输出结果 diff 全部一致， 但是我的代码是 WA。 为什么！！！ #include<iostream> #include<deque> using std::deque; using std::cout; using std::cin; using std::endl; int main() { std::ios::sync_with_stdio(false); int T; cin >> T; for (int t=0; t<T; t++) { int n; cin >> n; deque<int> Q; for (int i=n; i>0; i--) { Q.push_front(i); int t = Q.back(); Q.pop_back(); Q.push_front(t); } for (deque<int>::iterator it=Q.begin(); it!=Q.end(); it++) { if (it != Q.begin()) cout << ' '; cout << *it; } cout << endl; } return 0; }

#include<iostream> #include<deque> using namespace std; int main() { int T; cin >> T; int m = T; while (T--) { int n; cin >> n; deque<int> q; q.push_back(n); int i = n - 1; while (i>0) { q.push_front(i); int x = q.back(); q.pop_back(); q.push_front(x); --i; } for (int j = 0; j<q.size()-1; ++j) cout << q[j] << " "; cout << q[q.size() - 1] << endl; } //system("pause"); return 0; } 不知道哪里错了？？？？？求大神指点

哎，无限wrong answer但是跟大家贴出来的ac代码跑的结果一样，心累。。。

到底哪错了。。。 #pragma warning(disable:4996) #include <deque> #include <iostream> using namespace std; int main(void) { freopen("in.txt", "r", stdin); int T; cin >> T; while (T--) { int n; cin >> n; deque<int> que; for (int i = n; i > 0; --i) { que.push_front(i); int x = que.back(); que.pop_back(); que.push_front(x); } for (int i = 0; i < n - 1; ++i) cout << que[i] << " "; cout << que[n - 1] << endl; }  }

你第二题是什么？我也堵，我写了一个半小时，出题的队员不负责哦

第二题是哪一题。貌似大家顺序不一样。矩形么？

好像被打脸了...马有失手，人有失蹄....

题目数据错了,但是后台数据可能没错,纠结半天

兄弟们呀，你们问哪错了？ 我告诉你们，赛码网错了，后面赛码网系统出错了。

感觉错了啊 我用我的结果 试验了他的题目 试了好多都是对的

我猜你是洗牌