1 solutions
-
0
C++ :
#include<bits/stdc++.h> using namespace std; int t,n,x,y,a[60],b[60],tmp,bj; int main() { cin>>t; while(t--) { cin>>n>>x>>y; for(int i=1;i<=60;i++) b[i]=100000000; for(int i=1;i<=x;i++) { for(int j=1;j<=y-x;j++) { tmp=0; bj=0; a[1]=i; for(int k=2;k<=n;k++) a[k]=a[k-1]+j; for(int k=1;k<=n;k++) if(a[k]==x||a[k]==y) tmp++; if(tmp==2&&a[n]<b[n]) { for(int k=1;k<=n;k++) b[k]=a[k]; } } } for(int i=1;i<=n;i++) cout<<b[i]<<" "; cout<<endl; } return 0; }
- 1
Information
- ID
- 928
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By