https://codeforces.com/contest/1167/problem/B

題解：暴力?

/* *@Author: STZG *@Language: C++ */ #include <bits/stdc++.h> #include<iostream> #include<algorithm> #include<cstdlib> #include<cstring> #include<cstdio> #include<string> #include<vector> #include<bitset> #include<queue> #include<deque> #include<stack> #include<cmath> #include<list> #include<map> #include<set> //#define DEBUG #define RI register int #define endl "\n" using namespace std; typedef long long ll; //typedef __int128 lll; const int N=100000+10; const int M=100000+10; const int MOD=1e9+7; const double PI = acos(-1.0); const double EXP = 1E-8; const int INF = 0x3f3f3f3f; int t,n,m,k,p,l,r,u,v; int ans,cnt,flag,temp,sum; int b[10]; char str; struct node{}; int main() { #ifdef DEBUGfreopen("input.in", "r", stdin);//freopen("output.out", "w", stdout); #endif//ios::sync_with_stdio(false);//cin.tie(0);//cout.tie(0);//scanf("%d",&t);//while(t--){printf("? %d %d\n",1,2);fflush(stdout);scanf("%d",&b[1]);printf("? %d %d\n",2,3);fflush(stdout);scanf("%d",&b[2]);printf("? %d %d\n",4,5);fflush(stdout);scanf("%d",&b[3]);printf("? %d %d\n",5,6);fflush(stdout);scanf("%d",&b[4]);int a[6]={4 , 8, 15, 16, 23, 42};while(1){next_permutation(a, a+6);if(a[0]*a[1]==b[1]&&a[1]*a[2]==b[2]&&a[3]*a[4]==b[3]&&a[4]*a[5]==b[4]){printf("! %d %d %d %d %d %d\n",a[0],a[1],a[2],a[3],a[4],a[5],a[6]);break;}}//}#ifdef DEBUGprintf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC); #endif//cout << "Hello world!" << endl;return 0; }

?

總結(jié)

以上是生活随笔為你收集整理的Lost Numbers的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。