Public submissions
Source code of every submission to this problem in this contest
will be visible for everyone since 2014-03-30 20:30:00.
| Submit | All submissions | Best solutions | Back to list |
SAOS - Shashank And The Odd Sequence |
Given an array , Count the number in the array which occurs odd number of times.
Input
First line of input contains t(<100), number of test cases.
First line of every test case is the N (<10^5), size of the array.
Next line contains N numbers ( < 1000).
Output
Count the number in the array which occurs odd number of times.
Example
Input: 2
3
1 1 2
5
1 1 2 1 3
Output: 1
3
| Added by: | shashank |
| Date: | 2014-03-27 |
| Time limit: | 1s-2s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: ASM32-GCC ASM64 MAWK BC C-CLANG NCSHARP CPP14 CPP14-CLANG COBOL COFFEE D-CLANG D-DMD DART ELIXIR FANTOM FORTH GOSU GRV JS-MONKEY JULIA KTLN NIM OBJC OBJC-CLANG OCT PICO PROLOG PYPY PYPY3 R RACKET RUST CHICKEN SQLITE SWIFT UNLAMBDA VB.NET |
| Public source code since: | 2014-03-30 20:30:00 |
hide comments
|
2014-03-30 07:37:50 dhrumil
same problem for java Last edit: 2014-03-30 07:39:35 |
|
|
2014-03-29 22:01:31 berzentine
umm in java.. is there a particular requirment of naming the class or not using Scanner class or such ? or just evrythin works fine? |
RSS