| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 3915 | A班-许锘林 | 雇佣兵 | C++ | Wrong Answer | 50 | 1 MS | 252 KB | 388 | 2025-01-04 11:40:11 |
#include <bits/stdc++.h> using namespace std; int main() { int m; int n; int x; cin>>m>>n>>x; int zdl = n; int t; int a[m]; for(int i = 1;i <= m;i++) { t++; if(i > 1) { if(x >= m) { x -= m; zdl += m; } } if(t % n == 0) { zdl++; } a[i] = zdl; zdl = 0; } sort(a + 1,a + m + 1); cout<<a[m]<<endl; return 0; }