Submission #132501

---

Source Code Expand

#include <algorithm>
#include <vector>
#include <iostream>

int main()
{
	using namespace std;
    
	vector<int> nums;
	int i;
    int N;
    int temp=0;
    
    cin >> N;
    
	for( i = 1; i <= 6; ++i )
	{
		nums.push_back( i );
	}
    N=N%30;
    while(N>=5) {
        rotate(nums.begin(),nums.begin()+1,nums.end());
        N-=5;
    }
    
	// 先頭から４番目の要素が先頭にくるように回転
	//rotate( nums.begin(), nums.begin() + 3, nums.end() );
    
    for (int j=0;;++j) {
        if (N==0) break;
        temp = nums[j];
        nums[j] = nums[j+1];
        nums[j+1] = temp;
        N--;
    }
    
	for( i = 0; i < 6; ++i )
	{
		cout << nums[i];
	}
    cout << endl;
	return 0;
}

Submission Info

Judge Result