# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
272110 | 2020-08-18T09:05:38 Z | AKaan37 | Devil's Share (RMI19_devil) | C++17 | 65 ms | 1280 KB |
//Bismillahirrahmanirrahim //█▀█─█──█──█▀█─█─█ //█▄█─█──█──█▄█─█▄█ //█─█─█▄─█▄─█─█─█─█ #include <bits/stdc++.h> using namespace std; typedef long long lo; typedef pair< lo,lo > PII; #define fi first #define se second #define mp make_pair #define endl "\n" #define pb push_back #define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) #define FOR for(int i=1;i<=n;i++) #define mid ((start+end)/2) #define ort ((bas+son)/2) const lo inf = 1000000000000000000; const lo KOK = 100000; const lo LOG = 30; const lo li = 500005; const lo mod = 1000000007; int n,m,b[li],a[li],k,flag,t; int cev; string s; vector<int> v; int main(void){ scanf("%d",&t); while(t--){ scanf("%d",&n); for(int i=1;i<=9;i++){ scanf("%d",&a[i]); } while(1){ if(a[1]){ printf("1"); n--; a[1]--; } //~ if(n==0)break; if(a[2]){ printf("2"); n--; a[2]--; } if(a[1]==0 && a[2]==0)break; } printf("\n"); } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 384 KB | Token parameter [name=X] equals to "121", doesn't correspond to pattern "[0-9]{7}" |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 51 ms | 1280 KB | Token parameter [name=X] equals to "222222", doesn't correspond to pattern "[0-9]{31}" |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 65 ms | 1272 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 384 KB | Token parameter [name=X] equals to "121", doesn't correspond to pattern "[0-9]{7}" |