QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #572520 | #8936. Team Arrangement | ucup-team073# | WA | 0ms | 3724kb | C++14 | 416b | 2024-09-18 15:07:00 | 2024-09-18 15:07:00 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 55;
int a[maxn], m, len, dt;
char s[maxn];
void solve(){
scanf("%s",s + 1);
scanf("%d",&m);
len = strlen(s + 1);
int res = 0;
for(int i = 1; i <= len; ++i){
res = (res * 10 + (a[i] ^ 48)) % m;
}
dt = res;
if(dt == 0)dt == m;
}
int main(){
int t; scanf("%d",&t);
for(int i = 1; i <= t; ++i)solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3724kb
input:
3 2 3 1 2 2 2 4 5 100
output:
result:
wrong answer 1st lines differ - expected: '9', found: ''