source_code stringlengths 26 62k | lang_cluster stringclasses 11
values | src_uid stringlengths 32 32 | code_uid stringlengths 32 32 | difficulty int32 -1 3.5k ⌀ | exec_outcome stringclasses 1
value |
|---|---|---|---|---|---|
#include <iostream>
using namespace std;
bool sim(char c1, char c2) {
if (toupper(c1) == toupper(c2))
return true;
c1 = toupper(c1);
c2 = toupper(c2);
if (c1 == '0' && c2 == 'O')
return true;
if (c1 == '1' && c2 == 'L')
return true;
if (c1 == '1' && c2 == 'I')
return true;
if (c1 == 'L' ... | C++ | 0d70984ab8bd7aecd68c653adf54fc08 | e577a95c3feb600b668bed1b34dda9c7 | 1,200 | PASSED |
#include <iostream>
#include <string>
//#include <conio.h>
using namespace std;
int main()
{
string log;
cin >> log;
int q = log.length();
int n,k,otv=0;
cin >> n;
string str[1000];
for (int i = 0; i < n; i++)
cin >> str[i];
for (int i = 0; i < n; i++)
{
if (q == str[i].length() && otv==0)
{
k = 0;... | C++ | 0d70984ab8bd7aecd68c653adf54fc08 | ff596ae5e1b88c738b61f0abba231dcb | 1,200 | PASSED |
#include <bits/stdc++.h>
#define fr(i,a,b) for(int i = (a); i < (b); ++i)
#define pb push_back
#define ST first
#define ND second
#define inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
int row[1010];
int main(){
int n, m, k;
scanf("%d %d %d", &n, &m, &... | C++ | 65eb0f3ab35c4d95c1cbd39fc7a4227b | fc9b56bc04b1b59e42a98923b9930689 | 1,200 | PASSED |
#include <bits/stdc++.h>
#define fr(i,a,b) for(int i = (a); i < (b); ++i)
#define pb push_back
#define ST first
#define ND second
#define inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
int row[1010];
int main(){
int n, m, k;
scanf("%d %d %d", &n, &m, &... | C++ | 65eb0f3ab35c4d95c1cbd39fc7a4227b | 07c7b4d8fc3bb6df6f1e1030394625c6 | 1,200 | PASSED |
#include <bits/stdc++.h>
#define fr(i,a,b) for(int i = (a); i < (b); ++i)
#define pb push_back
#define ST first
#define ND second
#define inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
int row[1010];
int main(){
int n, m, k;
scanf("%d %d %d", &n, &m, &... | C++ | 65eb0f3ab35c4d95c1cbd39fc7a4227b | 54cdd74605b8415a3b12c034fd4cc34f | 1,200 | PASSED |
#include <bits/stdc++.h>
#define fr(i,a,b) for(int i = (a); i < (b); ++i)
#define pb push_back
#define ST first
#define ND second
#define inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
int row[1010];
int main(){
int n, m, k;
scanf("%d %d %d", &n, &m, &... | C++ | 65eb0f3ab35c4d95c1cbd39fc7a4227b | 6fe2a039a84ea872cd7429e007cdcda5 | 1,200 | PASSED |
#include <bits/stdc++.h>
#define fr(i,a,b) for(int i = (a); i < (b); ++i)
#define pb push_back
#define ST first
#define ND second
#define inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
int row[1010];
int main(){
int n, m, k;
scanf("%d %d %d", &n, &m, &... | C++ | 65eb0f3ab35c4d95c1cbd39fc7a4227b | 4e116f34ccbaeb47744c97afa5a22023 | 1,200 | PASSED |
#include <bits/stdc++.h>
#define fr(i,a,b) for(int i = (a); i < (b); ++i)
#define pb push_back
#define ST first
#define ND second
#define inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
int row[1010];
int main(){
int n, m, k;
scanf("%d %d %d", &n, &m, &... | C++ | 65eb0f3ab35c4d95c1cbd39fc7a4227b | 88a1779fc0bcc0b1b05f060801f482de | 1,200 | PASSED |
#include <bits/stdc++.h>
#define fr(i,a,b) for(int i = (a); i < (b); ++i)
#define pb push_back
#define ST first
#define ND second
#define inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
int row[1010];
int main(){
int n, m, k;
scanf("%d %d %d", &n, &m, &... | C++ | 65eb0f3ab35c4d95c1cbd39fc7a4227b | 0e2453ae3d29214cf7d0c0a2bd4c1869 | 1,200 | PASSED |
#include <bits/stdc++.h>
#define fr(i,a,b) for(int i = (a); i < (b); ++i)
#define pb push_back
#define ST first
#define ND second
#define inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
int row[1010];
int main(){
int n, m, k;
scanf("%d %d %d", &n, &m, &... | C++ | 65eb0f3ab35c4d95c1cbd39fc7a4227b | 1efd4bc4db0eabda3266955ad816a0a9 | 1,200 | PASSED |
#include <bits/stdc++.h>
#define fr(i,a,b) for(int i = (a); i < (b); ++i)
#define pb push_back
#define ST first
#define ND second
#define inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
int row[1010];
int main(){
int n, m, k;
scanf("%d %d %d", &n, &m, &... | C++ | 65eb0f3ab35c4d95c1cbd39fc7a4227b | b84c382c0c6d4dd59fe375c01be41806 | 1,200 | PASSED |
#include <bits/stdc++.h>
#define fr(i,a,b) for(int i = (a); i < (b); ++i)
#define pb push_back
#define ST first
#define ND second
#define inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
int row[1010];
int main(){
int n, m, k;
scanf("%d %d %d", &n, &m, &... | C++ | 65eb0f3ab35c4d95c1cbd39fc7a4227b | bf11fb495409744eafb0e9ac403ee8b0 | 1,200 | PASSED |
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <bi... | C++ | a95d9aef6a64c30e46330dcc8e6d4a67 | 32cee4e96e42d30641302eeb8a56cace | 2,600 | PASSED |
#include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
using namespace std;
#define LOG(x) cerr << #x << " = " << (x) << "\n"
typedef long long llint;
typedef pair<int,int> pii;
typedef long double ldouble;
int n, l;
char a[55][55];
llint masks[1<<20];
ldouble dp[1<<20];
inline int bc(llint... | C++ | a95d9aef6a64c30e46330dcc8e6d4a67 | 397bf714dcdd304ff8f8c3ca83e8e302 | 2,600 | PASSED |
#include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
using namespace std;
#define LOG(x) cerr << #x << " = " << (x) << "\n"
typedef long long llint;
typedef pair<int,int> pii;
typedef long double ldouble;
int n, l;
char a[55][55];
llint masks[1<<20];
ldouble dp[1<<20];
inline int bc(llint... | C++ | a95d9aef6a64c30e46330dcc8e6d4a67 | d6d87350e2561c1a3d60329e1ce2313f | 2,600 | PASSED |
#include <algorithm>
#include <cassert>
#include <cstring>
#include <iostream>
using namespace std;
#define LOG(x) cerr << #x << " = " << (x) << "\n"
typedef long long llint;
typedef pair<int,int> pii;
typedef long double ldouble;
int n, l;
char a[55][55];
llint masks[1<<20];
ldouble dp[1<<20];
inline int bc(llint... | C++ | a95d9aef6a64c30e46330dcc8e6d4a67 | 26a47c03384f4fe7c6924f7583fcd0fd | 2,600 | PASSED |
#include <bits/stdc++.h>
typedef long long int64;
#define sz(A) (int((A).size()))
using namespace std;
int64 fact(int n)
{
int64 res = 1;
for (int i = 1; i <= n; i++)
res *= i;
return res;
}
int64 binom(int m, int i)
{
return fact(m) / fact(m - i) / fact(i);
}
long long eq[1 << 20];
do... | C++ | a95d9aef6a64c30e46330dcc8e6d4a67 | 8989413de00446688ba5ffc51f3a3058 | 2,600 | PASSED |
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_DEPRECATE
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include ... | C++ | a95d9aef6a64c30e46330dcc8e6d4a67 | d0bc05fde5f04f5e3ed6a792f7a7aafe | 2,600 | PASSED |
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_DEPRECATE
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include ... | C++ | a95d9aef6a64c30e46330dcc8e6d4a67 | 7d98b52d31b489b457f520d3a55ebea4 | 2,600 | PASSED |
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_DEPRECATE
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include ... | C++ | a95d9aef6a64c30e46330dcc8e6d4a67 | 1afe70520fae6d59b8857de267f58f32 | 2,600 | PASSED |
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_DEPRECATE
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include ... | C++ | a95d9aef6a64c30e46330dcc8e6d4a67 | c635af4ad26b2b76b2dc9b0efed2ede7 | 2,600 | PASSED |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
#define M 1100100
#define B 22
#define K 55
int n, m;
double din[M];
unsigned long long d[B][M];
string s[K];
void read() {
cin >> n;
for (int i = 0; i < n; ++i)
cin >> s[i];
m = s[0].length();
}
v... | C++ | a95d9aef6a64c30e46330dcc8e6d4a67 | 317e4417d443d0c07fea567439faba2e | 2,600 | PASSED |
#include <fstream>
#include <stdio.h>
#include <iostream>
#include <string>
#include <set>
#include <algorithm>
#include <time.h>
#include <vector>
#include <map>
#define pb push_back
#define rep(i, x, y) for (int i = (x); i <= (y); i++)
#define ll long long
using namespace std;
#define RANGE (int) 2e5 + 100
#define T... | C++ | 7b12845f668e28b7f18019d5ab5eaec7 | ee1dbad9261bf08caa0090a47421169e | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5+5;
int a[N],b[N];
int n;
set <ll> s;
map <int,int> mp;
int main(){
scanf("%d",&n);
int cnt = 0;
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
if(!mp[a[i]]) mp[a[i]]=++cnt;
b[mp[a[i]]]++;
}
sort(... | C++ | 7b12845f668e28b7f18019d5ab5eaec7 | c6fe46c9336ada45923a97fa8ba2ec6c | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5+5;
int a[N],b[N];
int n;
map <int,int> mp;
int main(){
scanf("%d",&n);
int cnt = 0;
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
if(!mp[a[i]]) mp[a[i]]=++cnt;
b[mp[a[i]]]++;
}
sort(b+1,b+cnt+1)... | C++ | 7b12845f668e28b7f18019d5ab5eaec7 | 7b1f3b5be9b2407c5af57a4b5d5bc7b0 | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5+5;
int a[N],b[N];
int n;
multiset <ll> s;
map <int,int> mp;
int main(){
scanf("%d",&n);
int cnt = 0;
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
if(!mp[a[i]]) mp[a[i]]=++cnt;
b[mp[a[i]]]++;
}
... | C++ | 7b12845f668e28b7f18019d5ab5eaec7 | f8d4bb6672b7a8ea226b88f067249ca0 | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
const int N=1e6+7;
int n,dp[N];
map<int,int> cnt;
vector<int> v;
void greedy()
{
int ans=0;
for(int x:v)
for(int j=1;j<=x;j++)
{
dp[j]=max(dp[j],j+dp[2*j]);
ans=max(ans,dp[j]);
}
cout<<ans;
}
int main()
{
// freopen("i.inp","r",stdin);
ios_base::sync... | C++ | 7b12845f668e28b7f18019d5ab5eaec7 | e8008676549d617f35ee66b46a00fdfc | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int a[2*100009];
vector<long long>vv;
int mx[2*200000];
map<long long,int>mm;
int aa[2*200000];
vector <long long>v;
map<long long,int>m;
int main()
{
int n;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);m[a[i]]++;
}
for(auto it:m)
{
mm[it.second]++;
... | C++ | 7b12845f668e28b7f18019d5ab5eaec7 | 65e3ca1a2ba8e5b9582eb7ecaec9f1de | 1,800 | PASSED |
#include <bits/stdc++.h>
using namespace std;
int a[2*100009];
//fsdfs
vector<long long>vv;
int mx[2*200000];
map<long long,int>mm;
int aa[2*200000];
vector <long long>v;
map<long long,int>m;
int main()
{
int n;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&a[i]);m[a[i]]++;
}
for(auto it:m)
{
mm[it.sec... | C++ | 7b12845f668e28b7f18019d5ab5eaec7 | 0e9f7e5d723a429290e613b5faab6396 | 1,800 | PASSED |
#include<bits/stdc++.h>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vll;
typedef long double LD;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef pair<string,ll> psl;
typedef vector<psl> vpsl;
typedef vector... | C++ | 7b12845f668e28b7f18019d5ab5eaec7 | 1e193c07d9ffdceb540fe74bfd24ed57 | 1,800 | PASSED |
#include<bits/stdc++.h>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vll;
typedef long double LD;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef pair<string,ll> psl;
typedef vector<psl> vpsl;
typedef vector... | C++ | 7b12845f668e28b7f18019d5ab5eaec7 | 3929edf51558ae9629f9a3c6f898250d | 1,800 | PASSED |
#include<bits/stdc++.h>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vll;
typedef long double LD;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef pair<string,ll> psl;
typedef vector<psl> vpsl;
typedef vector... | C++ | 7b12845f668e28b7f18019d5ab5eaec7 | 1fcf39393759a6b6cc2d6fb04b27de07 | 1,800 | PASSED |
import java.io.*
import java.util.*
fun main(args : Array<String>) {
Thread { run() }.start()
}
fun run() {
val scanner = Scanner(System.`in`)
val n = scanner.nextInt()
val arr = IntArray(n) { scanner.nextInt() }
for (i in 0 until n) {
if (arr[i] % 2 == 0)
arr[i]--
pri... | Kotlin | d00696cb27c679dda6e2e29314a8432b | 5075bc84917fe47bff64befc94353e72 | 800 | PASSED |
fun main() {
val r = System.`in`.bufferedReader()
val s = StringBuilder()
val n = r.readLine()!!.toInt()
//var (n, m) = r.readLine()!!.split(" ").map { it.toInt() }
val v = r.readLine()!!.split(" ").map { it.toInt() }.map { if (it%2==0) it-1 else it}
println(v.joinToString(" "))
} | Kotlin | d00696cb27c679dda6e2e29314a8432b | 94404ff5bf059508f1e2c0bec531db90 | 800 | PASSED |
import java.util.*
object A {
val scanner = Scanner(System.`in`)
var n : Int = 0
lateinit var a : Array<Int>
fun readInput() : A {
n = scanner.nextLine().trim().toInt()
a = scanner.nextLine().trim().split(" ").map{ it.toInt() }.toTypedArray()
return this
}
fun solve() {... | Kotlin | d00696cb27c679dda6e2e29314a8432b | 3e2af679fb00d51fab2b0045e9418684 | 800 | PASSED |
fun main(args: Array<String>) {
val n = readLine()!!.toInt()
val nums = readLine()!!.splitToIntArray()
repeat(n) {
nums[it] -= if (nums[it] % 2 == 0) 1 else 0
}
println(nums.joinToString(" "))
}
private fun String.toLettersList(): List<String> {
return toCharArray().map { it.toString() }
}
private ... | Kotlin | d00696cb27c679dda6e2e29314a8432b | ba2b52d968ccd5066b702c736c1cbfd1 | 800 | PASSED |
fun Boolean.toInt() = if (this) 1 else 0
fun main(args: Array<String>) {
val n: Int = readLine()!!.toInt()
val a = readLine()!!.split(" ").map(String::toInt)
print(a.joinToString(separator = " ") { (it - (it%2==0).toInt()).toString() })
} | Kotlin | d00696cb27c679dda6e2e29314a8432b | df569074a90c894d50b73acd15ee0cb4 | 800 | PASSED |
import java.util.*
fun main(args: Array<String>) {
val sc = Scanner(System.`in`)
val n = sc.nextInt()
var arr = Array(n) { i -> sc.nextInt() }
for(i in 0 until n)
if(arr[i] % 2 == 0)
arr[i] = arr[i] - 1
arr.forEach { i -> print("" + i + " ") }
} | Kotlin | d00696cb27c679dda6e2e29314a8432b | a2ff646663d7b987b86ba7fce638b851 | 800 | PASSED |
/* https://codeforces.com/problemset/problem/1006/A */
fun main() {
readLine() // skip first line
val numbers = readLine()!!.split(" ")
.map { it.toInt() }
.map { if (it % 2 == 0) it - 1 else it }
print(numbers.joinToString(separator = " "))
} | Kotlin | d00696cb27c679dda6e2e29314a8432b | bc729c23338e7e6d1290d91d22cffe72 | 800 | PASSED |
fun main() {
var n = readLine()!!.toInt()
var num = readLine()!!.split(' ').map { it.toInt() }.toTypedArray().toIntArray()
for (i in 0 until n) {
var k = num[i]
for (j in 0 until n)
if (num[j] == k)
if (k % 2 == 0) num[j]--
}
for (i in num)
print("... | Kotlin | d00696cb27c679dda6e2e29314a8432b | 12831b375db08733a24b0d5649b03e70 | 800 | PASSED |
import java.io.BufferedInputStream
import java.util.*
fun main(args: Array<String>) {
val scanner = Scanner(BufferedInputStream(System.`in`))
val n = scanner.nextInt()
val joiner = StringJoiner(" ")
for (i in 0 until n) {
val a = scanner.nextInt()
if (a % 2 == 0) {
joiner.a... | Kotlin | d00696cb27c679dda6e2e29314a8432b | d3ef769256803c6b9bd3a563c8a87415 | 800 | PASSED |
fun main() {
var a = readLine()!!.toInt()
var list = readLine()!!.split(' ').map { if (it.toInt() % 2 == 0) it.toInt() - 1 else it.toInt() }
for (i in list){
print("$i ")
}
} | Kotlin | d00696cb27c679dda6e2e29314a8432b | 70153207e80af36f490abd77da500281 | 800 | PASSED |
#include "stdio.h"
#include "conio.h"
#include "stdlib.h"
#include "iostream"
#include <stdint.h>
using namespace std;
int main()
{ __int64 n = 0 ;
cin >> n;
size_t num[90000];
size_t num2[10001][2];
size_t a[100000];
for (int i = 0 ; i < n ; i++)
{
cin >> a[i];
}
__int64 q = 2;
num[0] = 1;
for... | C++ | 0b229ddf583949d43d6f1728e38c3cad | 4207eb99345b1c152b435d6f5bf4ccfe | 1,300 | PASSED |
#include "stdio.h"
#include "conio.h"
#include "stdlib.h"
#include "iostream"
#include <stdint.h>
using namespace std;
int main()
{ __int64 n = 0 ;
cin >> n;
size_t num[90000];
size_t num2[10001][2];
size_t a[100000];
for (int i = 0 ; i < n ; i++)
{
cin >> a[i];
}
__int64 q = 2;
num[0] = 1;
for... | C++ | 0b229ddf583949d43d6f1728e38c3cad | fb2b5ec9b16530c384d028a450d0f8a8 | 1,300 | PASSED |
#include<iostream>
using namespace std;
int main(){
long long n;
cin>>n;
long long count = n;
long long check = 1;
long long a[n];
cin>>a[0];
for(long long i = 1; i < n; i++){
cin>>a[i];
if(a[i-1] == a[i]){
check++;
}
if(a[i-1] != a[i] || (i == n-1 && ... | C++ | 0b229ddf583949d43d6f1728e38c3cad | d0fa93296f1b66691c51b4b2a3118255 | 1,300 | PASSED |
#include<iostream>
using namespace std;
int main(){
long long n;
cin>>n;
long long count = n;
long long check = 1;
long long a[n];
cin>>a[0];
for(long long i = 1; i < n; i++){
cin>>a[i];
if(a[i-1] == a[i]){
check++;
}
if(a[i-1] != a[i] || (i == n-1 && ... | C++ | 0b229ddf583949d43d6f1728e38c3cad | dc607c043106f8107f55397af63c2c60 | 1,300 | PASSED |
#include<iostream>
using namespace std;
int main()
{
__int64 n,i,k,a[100001],count;
while(cin >> n)
{
count = 0;
for(i=1;i<=n;i++)
{
cin >> a[i];
}
for(i=1;i<=n;i++)
{
__int64 plus = 1;
for(k=i;k<n;k++)
{
if(a[k]==a[k+1])
if(k+1!=... | C++ | 0b229ddf583949d43d6f1728e38c3cad | 01350055c54ea0c8acbfeefe0bff4b29 | 1,300 | PASSED |
#include <iostream>
using namespace std;
int main()
{
long int n;
cin>>n;
int* a=new int[n];
for(int i=0;i<n;i++) cin>>a[i];
long long l=0;
long long j=1;
for(int i=1;i<n;i++)
{
if(a[i]!=a[i-1])
{
l+=(1+j)*j/2;
j=1;
}
else
{
j++;
}
}
l+=(1+j)*j/2;
cout<<l;
return 0;
} | C++ | 0b229ddf583949d43d6f1728e38c3cad | 5488f72f3d7aa9588ea39e4214327567 | 1,300 | PASSED |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
__int64 get (__int64 x)
{
return x * (x-1) / 2;
}
int main()
{
__int64 res = 0;
int n;
scanf("%d",&n);
int i;
int cur = 0;
int pre;
int x;
for (i = 0; i < n; i++)
{
scanf ("... | C++ | 0b229ddf583949d43d6f1728e38c3cad | eb93629e39eca1b1c23d99853fc4cf09 | 1,300 | PASSED |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
__int64 get (__int64 x)
{
return x * (x-1) / 2;
}
int main()
{
__int64 res = 0;
int n;
scanf("%d",&n);
int i;
int cur = 0;
int pre;
int x;
for (i = 0; i < n; i++)
{
scanf ("... | C++ | 0b229ddf583949d43d6f1728e38c3cad | 6e6ae63867acfc1cfefa3e889a7108ae | 1,300 | PASSED |
#include <stdio.h>
#include <iostream>
using namespace std;
long long int n,arr[100000],i,c,res;
int main()
{
scanf("%d",&n);
c=0;
for (i=0;i<n;i++)
{
scanf("%d",&arr[i]);
if ((i==0) || (arr[i-1]!=arr[i]))
{
res+=((c+1)*c)/2;
c=1;
}
else
... | C++ | 0b229ddf583949d43d6f1728e38c3cad | dfdded4565c4b15ccfeab65bc84f9fb2 | 1,300 | PASSED |
#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm> // require sort next_permutation count etc.
#include <cstdlib> // require abs
#include <cstdio> // require printf
#include <functional>
#include <numeric> // requ... | C++ | 0b229ddf583949d43d6f1728e38c3cad | 8922cf9156c2cc19fa200507c5c01fcf | 1,300 | PASSED |
#include<cstring>
#include<stdio.h>
#include<cmath>
#include<map>
#include<vector>
#include<set>
#include<sstream>
#include<queue>
#include<algorithm>
#include<stack>
#include<cstdlib>
#include<deque>
#include<bitset>
#include<iostream>
#define FIN freopen("D://debug//in.txt","r",stdin);
#define FOUT freopen("D://debu... | C++ | e367f5d18b08882ec518b2d4188ccdea | 3059b9f301f2df4264fcbfb0d34109be | 1,800 | PASSED |
#ifndef Local
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx")
#endif
#include <bits/stdc++.h>
#include <ext/numeric>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
using... | C++ | e367f5d18b08882ec518b2d4188ccdea | 671f8faffd5cc4b7fae46e6dccfde048 | 1,800 | PASSED |
/***
chauhan176's code
Nothing Happens , It's True
***/
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long int
#define ld long double
#define fi first
#define se second
#define mod 1000000007
#define maxn 300005
#define all(v) v.begin(),v.end()
#define fastio ios::sync_with_stdio(... | C++ | e367f5d18b08882ec518b2d4188ccdea | ea86a29362d7fa05352239dea9276238 | 1,800 | PASSED |
#include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1000000000
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795L
#ifdef ONLINE_JUDGE
#define debug(args...)
#else
#include "debug.h"
#endif
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll,... | C++ | e367f5d18b08882ec518b2d4188ccdea | f73765f6a533296726ab3064c0f49bd1 | 1,800 | PASSED |
#include <bits/stdc++.h>
#define _for(i,a,b) for(int i=(a),_b=(b);i<_b;++i)
using namespace std;
string a;
int k;
typedef long long ll;
const ll mod = 1000000007;
const int maxn=1001;
ll f[maxn];
ll F[maxn];
ll B[maxn];
ll gt[maxn];
ll igt[maxn];
ll _pow(ll A,ll B)
{
if (B==0) return ll(1);
ll p = _pow(A, B/2)... | C++ | e367f5d18b08882ec518b2d4188ccdea | bbf17015fa5c4e132919f9c5ddab38f2 | 1,800 | PASSED |
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <b... | C++ | e367f5d18b08882ec518b2d4188ccdea | 87427651bf4ab1d80d66d1aecb629f20 | 1,800 | PASSED |
#pragma comment(linker, "/STACK:33554432")
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <string>
#include <queue>
#include <unordered_map>
#include <cmath>
#include <iterator>
#include <stack>
#include <unordered_set>
#include <iomanip... | C++ | e367f5d18b08882ec518b2d4188ccdea | 22903c16ec9959142aabb4b821b476a6 | 1,800 | PASSED |
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
typedef long long ll;
const ll mod=1e9+7;
string s;
int k;
int steps[1100];
ll cnts[1100];
ll C[1100][1100];
ll dp1[1100];
ll dp2[1100];
int main(){
ios::sync_with_stdio(0);
for (int i=0;i<=1000;++i)C[i][0]=1;
for (int i=1;i<=1000;++i)
f... | C++ | e367f5d18b08882ec518b2d4188ccdea | 4a5198e8124c94b33e988573512bb996 | 1,800 | PASSED |
#ifdef _MSC_VER
# include <intrin.h>
# define __builtin_popcount __popcnt
#endif
#include <iostream>
#include <cstring>
#define N 1005
#define MOD 1000000007
char str[N]; bool buf[N];
long long dp[N][2][N];
long long dfs(int x, bool b, int c)
{
if(c > x) return 0;
if(x == 0 || c == 0) return 1;
long long &cur = ... | C++ | e367f5d18b08882ec518b2d4188ccdea | 445899e420db7870e63635ced776df95 | 1,800 | PASSED |
#define _CRT_SECURE_NO_WARNINGS
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <algorithm>
int NumBits(int v)
{
int c = 0;
while (v > 0)
{
if (v % 2 == 1)
++c;
v /= 2;
}
return c;
}
int const MOD = 1000000007;
int const MAXN = 1024;
int CNK[MAXN + 1][MAXN + 1];
int cnk(int n, int k)
... | C++ | e367f5d18b08882ec518b2d4188ccdea | f9279e277a9d866ee111a7dfc51a25ca | 1,800 | PASSED |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <cstring>
#include <cctype>
#include <cassert>
#include <cstddef>
#include <algorithm>
#include <map>
#include <set>
#include <utility>
#include <list>
#include <deque>
#include <queue>
#include <stack>
#include <memory>
#include <itera... | C++ | d00b8423c3c52b19fec25bc63e4d4c1c | c6307ab4f89f031db54d81bb9427dfd0 | 1,500 | PASSED |
#include <algorithm>
#include <iostream>
#include <fstream>
#include <cstdlib>
#include <string.h>
#include <math.h>
#include <deque>
#include <vector>
#include <queue>
using namespace std;
#define X first
#define Y second
#define INPUT freopen(".inp","r",stdin)
#define OUTPUT freopen(".out","w",stdout)
#define FOR(i... | C++ | d00b8423c3c52b19fec25bc63e4d4c1c | 93efc373d4debd8ba9bc39c3799d43d0 | 1,500 | PASSED |
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string>
#include<string.h>
#include<vector>
#include<map>
#include<algorithm>
#include<limits.h>
#include<set>
#include<math.h>
using namespace std;
#define in(t) scanf("%d",&t)
#define inf(t) scanf("%lf",&t)
#define mod 1000000007
int main()
{
dou... | C++ | d00b8423c3c52b19fec25bc63e4d4c1c | 358aa611270bd61dd93101694c3a1448 | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
const double eps=1e-10;
typedef pair<double,double>Point;
double a,d;
int n;
int main()
{
while(scanf("%lf %lf %d",&a,&d,&n)==3)
{ Point curpoint;
double extra;
for(int i=1;i<=n;i++)
{
extra=f... | C++ | d00b8423c3c52b19fec25bc63e4d4c1c | cb620656ae361a0235988cf107027f3d | 1,500 | PASSED |
#include<cstdio>
#include<cstring>
#include<cmath>
int main()
{
double a,d,x=0,D=0.0,b;
int n,m,r=0,i,y;
//char A[50],dd[50];
scanf("%lf%lf",&a,&d);
scanf("%d",&n);
for(i=0;i<n;i++)
{
D+=d;
//x=mod(D,a);
y=floor(D/a);
x=D-a*y;
y=y%4;
m=floor(D/(4*a));
D-=m*4*a;
if(y>=0 && y<1)
printf("%.4lf00... | C++ | d00b8423c3c52b19fec25bc63e4d4c1c | cd4db787cdd254e6e97dc2b20ae773fe | 1,500 | PASSED |
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
void escribe(double x,double y)
{
printf("%.8lf %.8lf\n",x,y);
}
int main()
{
//ios::sync_with_stdio(false);
//cout.setf(ios::fixed);
//cout.precision(10);
double a,d;
int n;
//float ina,ind;
//scanf("%lf %lf %d",&a,&d,&n);
... | C++ | d00b8423c3c52b19fec25bc63e4d4c1c | 8dae10622c93a19efc59766e7f217a46 | 1,500 | PASSED |
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
void escribe(double x,double y)
{
printf("%.8lf %.8lf\n",x,y);
}
int main()
{
//ios::sync_with_stdio(false);
//cout.setf(ios::fixed);
//cout.precision(10);
double a,d;
int n;
//float ina,ind;
scanf("%lf %lf %d",&a,&d,&n);
//... | C++ | d00b8423c3c52b19fec25bc63e4d4c1c | f710e02ce4c39234617e74e40727f01e | 1,500 | PASSED |
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
typedef long long int ll;
void escribe(double x,double y)
{
printf("%.8lf %.8lf\n",x,y);
}
int main()
{
//ios::sync_with_stdio(false);
//cout.setf(ios::fixed);
//cout.precision(10);
double a,d;
int n;
//float ina,ind;
scanf("... | C++ | d00b8423c3c52b19fec25bc63e4d4c1c | d92d890a9e26613054df017f088831e5 | 1,500 | PASSED |
#include <stdio.h>
#define EPS 1e-13
double a, d;
int n;
long long la, ld;
int i;
int main() {
scanf("%lf %lf", &a, &d);
scanf("%d", &n);
la = a * 100000 + 0.5;
ld = d * 100000 + 0.5;
long long L = la * 4;
for (i = 1; i <= n; i++) {
long long D = i*ld;
long long r = D % L;
if (r == 0) ... | C++ | d00b8423c3c52b19fec25bc63e4d4c1c | a549fd2fe6e62266409653a5d870cfee | 1,500 | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
double a,d;
scanf("%lf %lf",&a,&d);
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
double c = fmod(i*d,4*a);
if(c<a)
{
printf("%.8f %.8f\n",c,0.0);
}
else if(c<2*a)
{
printf("%.8f %.8f\n",a,c - a);
}
else if(c<3*a)
{
printf("%.8f... | C++ | d00b8423c3c52b19fec25bc63e4d4c1c | ec9fb3d678049bd3c0b468ed8566c9b0 | 1,500 | PASSED |
//
// Created by bhanu_prakash7 on 31/1/19.
//
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
long long int f[n+1]={0};
long long int cost[n+1]={0};
long long int total=0;
vector< pair<long long int,long long int> >v(n+1);
v[0].first=0;
v[0].second=0... | C++ | 2553ffea6d74fded12128e9db0db85dc | 7ddf15976c67e6da6363b07b1b9f1ac0 | 1,500 | PASSED |
#include <bits/stdc++.h>
#define N 300010
#define PII pair<int, int>
using namespace std;
typedef long long LL;
int n, m, a[N], c[N], t, d;
LL ans = 0;
priority_queue<PII, vector<PII>, greater<PII> > Q;
int main(){
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++){
scanf("%d", &a[i]);
}
for (int i = 1; i... | C++ | 2553ffea6d74fded12128e9db0db85dc | 8f6ce1c85579de3ab31743a08f5cf445 | 1,500 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <set>
#include <cctype>
using namespace std;
int main()
{
long long n, m;
cin >> n >> m;
vector<long long> a, c;
multiset<pair<long long, long long> > price;
for (long long i = 0, x; i < n; i++)
{
cin >> x;
a.push_back(x);... | C++ | 2553ffea6d74fded12128e9db0db85dc | 561ce60d98574eaee24a15c227a69b95 | 1,500 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <set>
#include <cctype>
#define _getchar_nolock getchar
#define _putchar_nolock putchar
using namespace std;
void scann(long long &x) {
x = 0;
long long ch = _getchar_nolock();
long long flg = 1;
if ((char)ch == '-') flg = -1;
w... | C++ | 2553ffea6d74fded12128e9db0db85dc | 4a8e71796c01f56c4524b8b231101d20 | 1,500 | PASSED |
#include <iostream>
#include <algorithm>
#include <math.h>
#include <vector>
#include <queue>
#include <set>
#include <map>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
int n, m = 0;
cin >> n >> m;
vector<long long> c, a;
vector<pair<long long, long long> > food;
for (int i = 0; i < ... | C++ | 2553ffea6d74fded12128e9db0db85dc | 93d5041c8a6ec18b447546b97bffcfa6 | 1,500 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <set>
#include <cctype>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
vector<long long> a, c;
multiset<pair<long long, long long> > price;
for (int i = 0, x; i < n;... | C++ | 2553ffea6d74fded12128e9db0db85dc | f73bd753c46b4ebc57aec07d183f036c | 1,500 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <set>
#include <cctype>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<long long> a, c;
multiset<pair<long long, long long> > price;
for (int i = 0, x; i < n; i++)
{
cin >... | C++ | 2553ffea6d74fded12128e9db0db85dc | 7ae5dde9c8d6d1d6cbd9c26392f8c303 | 1,500 | PASSED |
/*................:..:.:..........................::..::.......:..:.:.:.............................
................:.`.:..:............................::...::...::.1;.`...............................
..................#M@R&KXXXXXXXFXXXXXXFFXXXXFFFFYYYYXFKKK#$WNMMMMMMR::..............................
.................... | C++ | 2553ffea6d74fded12128e9db0db85dc | 8e9c9378e7f4f4427f30b508a55d34b9 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(0);cin.tie(0)
#define fp(i,a,b) for(int i=a ; i<b ; i++)
#define fn(i,a,b) for(int i=a ; i>=b ; i--)
#define fit(i,x) for(auto i=x.begin() ; i != x.end() ; i++)
#define pb push_back
#define ff first
#define ss second
#define all(x)... | C++ | 2553ffea6d74fded12128e9db0db85dc | 2a0412d436fbd1aac4e62f18a0d48682 | 1,500 | PASSED |
#include <bits/stdc++.h>
using namespace std;
#define optimize ios_base::sync_with_stdio(false)
#define FOR(i, a, n) for(int i = a; i < n; i++)
#define from_0_till(x) for(int i = 0; i < x; i++)
#define LL long long
#define ULL unsigned long long
#defin... | C++ | 2553ffea6d74fded12128e9db0db85dc | b8401ec132402a93a544b2f91873f6fc | 1,500 | PASSED |
import math
n = [int(i) for i in input().split(" ")]
data=[int(i) for i in input().split(" ")]
data.sort()
data.reverse()
p,s=0,0
for i in range(0,n[0]-1):
if data[i]<=data[i+1] and data[i]>1:
s+=data[i+1] + 1 - data[i]
data[i+1]=data[i]-1
if data[i]==1:
s+=data[i+1]-1
data[i+1]... | Python | ffa76f2558c8a70ab5c1ecb9e8561f25 | a219686e6a429192038d42db712f6c56 | 1,400 | PASSED |
# -*- coding: utf-8 -*-
"""
Created on Mon Dec 24 23:01:30 2018
@author: Nishant Mittal aka nishantwrp
"""
nos = list(map(int,input().split()))
n = nos[0]
data = list(map(int,input().split()))
suma = 0
for a in range(0,n):
suma +=data[a]
data.sort()
data.reverse()
ans = 0
data.append(0)
for i in range(0,n):
if... | Python | ffa76f2558c8a70ab5c1ecb9e8561f25 | 52d1f77b4c6080e4914a62958328e18f | 1,400 | PASSED |
n,m = map(int,input().split())
l = sorted(map(int,input().split()))
level = 0
for v in l:
level = min(v,level+1)
print(sum(l)-n-l[-1] +level) | Python | ffa76f2558c8a70ab5c1ecb9e8561f25 | 8c0711f41f30239f72245af82fbb8b52 | 1,400 | PASSED |
n, m = list(map(int, input().split()))
in_list = list(map(int,input().split()))
in_list.sort()
prev = 0
min_block = 0
for i in range(n) :
min_block = min_block + in_list[i] - prev
if min_block <= i :
min_block = min_block + 1
prev = in_list[i]
print(sum(in_list) - min_block) | Python | ffa76f2558c8a70ab5c1ecb9e8561f25 | 30b36d0a0df39754a0488d3bf26334e2 | 1,400 | PASSED |
# Main
def run():
n, mmm = map(int, input().split())
arr = list(map(int, input().split()))
arr.sort()
ans = 0
for i in range(n):
if arr[i] > ans:
ans += 1
left = arr[n-1] - ans
sol = sum(arr) - n - left
print(sol)
# end main
# Program Start
if __name__ == "__m... | Python | ffa76f2558c8a70ab5c1ecb9e8561f25 | ba096c5d5d5d2c5543460f0a31173cd1 | 1,400 | PASSED |
n, m = map(int, input().split())
l = list(map(int, input().split()))
l.sort()
res = 0
pre = l[0] - 1
for i in range(len(l) - 1):
if l[i] < l[i + 1]:
res += l[i]
pre += l[i + 1] - l[i] - 1
else:
res += l[i] - 1
if pre > 0:
pre -= 1
res += 1
print(res)
| Python | ffa76f2558c8a70ab5c1ecb9e8561f25 | ffc43172d14d799a348b0e9363101808 | 1,400 | PASSED |
n,m=map(int,input().split())
arr=list(map(int,input().split()))
arr.sort()
ans=0
height=0
for i in range(n):
if(arr[i]>height):
ans+=1
height+=1
else:
ans+=1
if(arr[-1]>height):
ans+=(arr[-1]-height)
print(sum(arr)-ans) | Python | ffa76f2558c8a70ab5c1ecb9e8561f25 | 0a45951ea1a895407dee3378a838ef05 | 1,400 | PASSED |
def solve():
N, M = map(int, input().split())
A = [int(k) for k in input().split()]
'''
if N == 1:
print (0)
return
'''
A.sort()
height = 0
for i in range(1,N+1):
if A[i-1] > height:
height += 1
res = N + (A[-1] - height)
... | Python | ffa76f2558c8a70ab5c1ecb9e8561f25 | 9851e3dedb76697f2a57354e06b9cc53 | 1,400 | PASSED |
n, m = map(int, input().split())
arr = list(map(int, input().split()))
arr.sort(reverse=True)
right = arr[0]
c = 0
for i in range(n):
if arr[i] >= right:
c += 1
right -= 1
else:
c += 1
right = arr[i]-1
if right == 0:
break
print(sum(arr)-(n-c)-(arr[0])) | Python | ffa76f2558c8a70ab5c1ecb9e8561f25 | c49b0b9d179919788198cb7513cdb2e9 | 1,400 | PASSED |
(n,m)=map(int,input().split())
l=list(map(int,input().split()))
l.sort(reverse=True)
sa=sum(l)
t=0
for i in range(len(l)-1):
if l[i]!=1:
if l[i]>l[i+1]:
t+=l[i]-l[i+1]
elif l[i]==l[i+1]:
l[i+1]-=1
t+=1
else:
l[i+1]=l[i]-1
t+=1
else:
t+=len(l)-1-i
l[-1]=1
break
t+=l[-1]
print(sa-t)
| Python | ffa76f2558c8a70ab5c1ecb9e8561f25 | 1df4e1ea71ac7f38eb6d51a2966b241d | 1,400 | PASSED |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
void q(int n){
for(int i=2;i<=n;i++){
cout<<i<<" ";
}
cout<<1<<" ";
cout<<endl;
}
int main (){
int t,n;
cin>>t;
while(t--){
cin>>n;
q(n);
}
} | C++ | f4779e16e0857e6507fdde55e6d4f982 | 9d03297c076dfa932dbd7f97ebc457fd | null | PASSED |
#include<iostream>
#include<vector>
#include<algorithm>
#define ll long long
#define pb push_back
#define sz size
#define r_0 return 0
#define dl "\n"
using namespace std;
vector< ll > v;
int main ()
{
ll t , n;
cin >> t;
while ( t > 0 )
{
cin >> n;
for ( ll i = 1; i < n; i ++ )
... | C++ | f4779e16e0857e6507fdde55e6d4f982 | 70f703b08313c4678b0d0f016ec37831 | null | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int ts,n,i;
cin>>ts;
while(ts--)
{
cin>>n;
for(i=1;i<n;i++)
cout<<i+1<<" ";
cout<<1<<endl;
}
return 0;
}
| C++ | f4779e16e0857e6507fdde55e6d4f982 | f90eadfbc435f96eaa550f6069da4bbe | null | PASSED |
/*
#we_love_mohammed(saw.)
#we_love_allah
#La_ilaha_illallahu_muhammadur_rasulullah
#we_love_islam
#Boycott_france_product
#Boycott_france
#Boycott_france_product
*/
/*******************************
* BASMIL... | C++ | f4779e16e0857e6507fdde55e6d4f982 | e708c946ff50391fab054dfea1325aab | null | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
#define x first
#define y second
#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
#define mp(a, b) make_pair(a,b)//将两个数据合成一个数据
#define rep(i,b) for(int i=0;i<b;i++)
#define For(i, a, b) ... | C++ | f4779e16e0857e6507fdde55e6d4f982 | 2c6dd1ba2b190b7d880b2f1d76fb13b2 | null | PASSED |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
#define x first
#define y second
//#pragma GCC optimize(1)
//#pragma GCC optimize(2)
//#pragma GCC optimize(3,"Ofast","inline")
#define mp(a, b) make_pair(a,b)//将两个数据合成一个数据
#define rep(i,b) for(int i=0;i<b;i++)
#define For(i, ... | C++ | f4779e16e0857e6507fdde55e6d4f982 | 9015d651e1f2d66e663a7b44eef3f511 | null | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
std::ios::sync_with_stdio(false);
int t;
cin>>t;
while(t--)
{
int n;
int a[100];
memset(a,0,sizeof(a));
cin>>n;
for(int i=0;i<n;i++)
{
a[i]=i+1;
}
if(n%2==0)//偶数
... | C++ | f4779e16e0857e6507fdde55e6d4f982 | f5d44a9f4d320f1e1aa220d0b1b16a2e | null | PASSED |
#include<bits/stdc++.h>
using namespace std;
int main()
{
std::ios::sync_with_stdio(false);
int t;
cin>>t;
while(t--)
{
int n;
int a[100];
memset(a,0,sizeof(a));
cin>>n;
for(int i=0;i<n;i++)
{
a[i]=i+1;
}
if(n%2==0)//偶数
... | C++ | f4779e16e0857e6507fdde55e6d4f982 | 999bfb86935a3a7d03cf2a1d3d82b898 | null | PASSED |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.